java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:57:36,536 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:57:36,539 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:57:36,552 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:57:36,552 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:57:36,553 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:57:36,556 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:57:36,558 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:57:36,559 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:57:36,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:57:36,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:57:36,562 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:57:36,563 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:57:36,564 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:57:36,566 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:57:36,567 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:57:36,569 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:57:36,578 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:57:36,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:57:36,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:57:36,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:57:36,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:57:36,586 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:57:36,586 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:57:36,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:57:36,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:57:36,589 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:57:36,590 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:57:36,591 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:57:36,591 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:57:36,591 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:57:36,592 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:57:36,592 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:57:36,596 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:57:36,596 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:57:36,597 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:57:36,615 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:57:36,616 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:57:36,616 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:57:36,616 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:57:36,617 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:57:36,617 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:57:36,618 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:57:36,618 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:57:36,618 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:57:36,618 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:57:36,618 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:57:36,618 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:57:36,619 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:57:36,621 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:57:36,621 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:57:36,622 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:57:36,622 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:57:36,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:57:36,622 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:57:36,623 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:57:36,624 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:57:36,670 INFO ]: Repository-Root is: /tmp [2018-06-22 11:57:36,689 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:57:36,692 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:57:36,694 INFO ]: Initializing SmtParser... [2018-06-22 11:57:36,694 INFO ]: SmtParser initialized [2018-06-22 11:57:36,695 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 [2018-06-22 11:57:36,696 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:57:36,787 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@68605b34 [2018-06-22 11:57:36,951 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__break_single.smt2 [2018-06-22 11:57:36,965 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:57:36,971 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:57:36,972 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:57:36,972 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:57:36,972 INFO ]: ChcToBoogie initialized [2018-06-22 11:57:36,981 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:57:36" (1/1) ... [2018-06-22 11:57:37,022 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:37 Unit [2018-06-22 11:57:37,023 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:57:37,023 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:57:37,023 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:57:37,023 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:57:37,044 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:37" (1/1) ... [2018-06-22 11:57:37,044 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:37" (1/1) ... [2018-06-22 11:57:37,050 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:37" (1/1) ... [2018-06-22 11:57:37,051 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:37" (1/1) ... [2018-06-22 11:57:37,053 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:37" (1/1) ... [2018-06-22 11:57:37,055 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:37" (1/1) ... [2018-06-22 11:57:37,055 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:37" (1/1) ... [2018-06-22 11:57:37,057 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:57:37,057 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:57:37,057 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:57:37,057 INFO ]: RCFGBuilder initialized [2018-06-22 11:57:37,061 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:37" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:57:37,078 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:57:37,078 INFO ]: Found specification of procedure False [2018-06-22 11:57:37,078 INFO ]: Found implementation of procedure False [2018-06-22 11:57:37,078 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:57:37,078 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:57:37,078 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:57:37,078 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:57:37,078 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:57:37,078 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:57:37,322 INFO ]: Using library mode [2018-06-22 11:57:37,322 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:57:37 BoogieIcfgContainer [2018-06-22 11:57:37,322 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:57:37,324 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:57:37,324 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:57:37,339 INFO ]: TraceAbstraction initialized [2018-06-22 11:57:37,339 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:57:36" (1/3) ... [2018-06-22 11:57:37,340 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4a02f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:57:37, skipping insertion in model container [2018-06-22 11:57:37,340 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:57:37" (2/3) ... [2018-06-22 11:57:37,341 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4a02f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:57:37, skipping insertion in model container [2018-06-22 11:57:37,341 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:57:37" (3/3) ... [2018-06-22 11:57:37,342 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:57:37,352 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:57:37,359 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:57:37,401 INFO ]: Using default assertion order modulation [2018-06-22 11:57:37,402 INFO ]: Interprodecural is true [2018-06-22 11:57:37,402 INFO ]: Hoare is false [2018-06-22 11:57:37,402 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:57:37,402 INFO ]: Backedges is TWOTRACK [2018-06-22 11:57:37,402 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:57:37,402 INFO ]: Difference is false [2018-06-22 11:57:37,402 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:57:37,402 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:57:37,416 INFO ]: Start isEmpty. Operand 15 states. [2018-06-22 11:57:37,427 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:57:37,427 INFO ]: Found error trace [2018-06-22 11:57:37,428 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:37,428 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:37,433 INFO ]: Analyzing trace with hash -911285918, now seen corresponding path program 1 times [2018-06-22 11:57:37,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:37,441 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:37,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:37,496 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:37,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:37,533 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:37,709 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:57:37,713 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:57:37,713 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:57:37,714 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:57:37,725 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:57:37,725 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:57:37,730 INFO ]: Start difference. First operand 15 states. Second operand 4 states. [2018-06-22 11:57:37,847 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:37,847 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-22 11:57:37,847 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:57:37,848 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:57:37,849 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:37,857 INFO ]: With dead ends: 15 [2018-06-22 11:57:37,857 INFO ]: Without dead ends: 15 [2018-06-22 11:57:37,860 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:57:37,873 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 11:57:37,910 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 11:57:37,911 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 11:57:37,912 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 11:57:37,913 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2018-06-22 11:57:37,914 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:37,914 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 11:57:37,914 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:57:37,914 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 11:57:37,916 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:57:37,916 INFO ]: Found error trace [2018-06-22 11:57:37,916 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:37,916 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:37,917 INFO ]: Analyzing trace with hash 1546110726, now seen corresponding path program 1 times [2018-06-22 11:57:37,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:37,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:37,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:37,918 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:37,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:37,933 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:38,134 WARN ]: Spent 122.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 4 [2018-06-22 11:57:38,396 WARN ]: Spent 205.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-06-22 11:57:38,548 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:38,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:38,549 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-06-22 11:57:38,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:38,607 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:38,617 INFO ]: Computing forward predicates... [2018-06-22 11:57:38,783 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-06-22 11:57:39,037 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:39,057 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:39,057 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:57:39,058 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:57:39,058 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:57:39,059 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:57:39,059 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 10 states. [2018-06-22 11:57:39,544 WARN ]: Spent 253.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-06-22 11:57:39,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:39,809 INFO ]: Finished difference Result 19 states and 31 transitions. [2018-06-22 11:57:39,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:57:39,809 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:57:39,810 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:39,810 INFO ]: With dead ends: 19 [2018-06-22 11:57:39,810 INFO ]: Without dead ends: 19 [2018-06-22 11:57:39,811 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:57:39,812 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:57:39,817 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:57:39,817 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:57:39,818 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2018-06-22 11:57:39,818 INFO ]: Start accepts. Automaton has 17 states and 26 transitions. Word has length 13 [2018-06-22 11:57:39,818 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:39,818 INFO ]: Abstraction has 17 states and 26 transitions. [2018-06-22 11:57:39,818 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:57:39,818 INFO ]: Start isEmpty. Operand 17 states and 26 transitions. [2018-06-22 11:57:39,819 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:57:39,819 INFO ]: Found error trace [2018-06-22 11:57:39,819 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:39,819 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:39,820 INFO ]: Analyzing trace with hash 2036612432, now seen corresponding path program 1 times [2018-06-22 11:57:39,820 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:39,820 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:39,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:39,821 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:39,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:39,830 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:39,953 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:39,953 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:39,953 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:39,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:39,982 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:39,984 INFO ]: Computing forward predicates... [2018-06-22 11:57:40,036 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:40,055 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:57:40,055 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 11:57:40,055 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:57:40,056 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:57:40,056 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:57:40,056 INFO ]: Start difference. First operand 17 states and 26 transitions. Second operand 8 states. [2018-06-22 11:57:40,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:40,166 INFO ]: Finished difference Result 19 states and 30 transitions. [2018-06-22 11:57:40,166 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:57:40,166 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:57:40,166 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:40,167 INFO ]: With dead ends: 19 [2018-06-22 11:57:40,167 INFO ]: Without dead ends: 19 [2018-06-22 11:57:40,168 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:57:40,168 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:57:40,173 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:57:40,173 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:57:40,174 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-06-22 11:57:40,174 INFO ]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 13 [2018-06-22 11:57:40,174 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:40,174 INFO ]: Abstraction has 17 states and 25 transitions. [2018-06-22 11:57:40,174 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:57:40,174 INFO ]: Start isEmpty. Operand 17 states and 25 transitions. [2018-06-22 11:57:40,175 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:57:40,175 INFO ]: Found error trace [2018-06-22 11:57:40,175 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:40,175 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:40,175 INFO ]: Analyzing trace with hash 1791361579, now seen corresponding path program 1 times [2018-06-22 11:57:40,175 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:40,175 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:40,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:40,176 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:40,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:40,184 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:40,359 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:40,359 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:40,359 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:40,368 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:40,374 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:40,376 INFO ]: Computing forward predicates... [2018-06-22 11:57:40,440 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:57:40,463 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:57:40,466 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2018-06-22 11:57:40,466 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:57:40,467 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:57:40,467 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:57:40,467 INFO ]: Start difference. First operand 17 states and 25 transitions. Second operand 7 states. [2018-06-22 11:57:40,610 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:40,610 INFO ]: Finished difference Result 19 states and 29 transitions. [2018-06-22 11:57:40,610 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:57:40,610 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:57:40,610 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:40,611 INFO ]: With dead ends: 19 [2018-06-22 11:57:40,611 INFO ]: Without dead ends: 19 [2018-06-22 11:57:40,612 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:57:40,612 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:57:40,616 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:57:40,616 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:57:40,616 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-06-22 11:57:40,616 INFO ]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 13 [2018-06-22 11:57:40,617 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:40,617 INFO ]: Abstraction has 17 states and 24 transitions. [2018-06-22 11:57:40,617 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:57:40,617 INFO ]: Start isEmpty. Operand 17 states and 24 transitions. [2018-06-22 11:57:40,618 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:57:40,618 INFO ]: Found error trace [2018-06-22 11:57:40,618 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:40,618 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:40,618 INFO ]: Analyzing trace with hash -852243286, now seen corresponding path program 2 times [2018-06-22 11:57:40,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:40,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:40,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:40,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:40,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:40,628 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:40,775 INFO ]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:57:40,775 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:40,775 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:40,783 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:40,807 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:40,807 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:40,809 INFO ]: Computing forward predicates... [2018-06-22 11:57:40,915 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:57:40,945 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:40,945 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 11:57:40,946 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:57:40,946 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:57:40,946 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:57:40,946 INFO ]: Start difference. First operand 17 states and 24 transitions. Second operand 12 states. [2018-06-22 11:57:41,152 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:41,152 INFO ]: Finished difference Result 23 states and 37 transitions. [2018-06-22 11:57:41,152 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:57:41,152 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:57:41,153 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:41,153 INFO ]: With dead ends: 23 [2018-06-22 11:57:41,153 INFO ]: Without dead ends: 23 [2018-06-22 11:57:41,154 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:57:41,154 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:57:41,158 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-06-22 11:57:41,159 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:57:41,159 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-06-22 11:57:41,159 INFO ]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 17 [2018-06-22 11:57:41,159 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:41,159 INFO ]: Abstraction has 17 states and 24 transitions. [2018-06-22 11:57:41,159 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:57:41,159 INFO ]: Start isEmpty. Operand 17 states and 24 transitions. [2018-06-22 11:57:41,160 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:57:41,160 INFO ]: Found error trace [2018-06-22 11:57:41,160 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:41,160 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:41,161 INFO ]: Analyzing trace with hash 967471092, now seen corresponding path program 1 times [2018-06-22 11:57:41,161 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:41,161 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:41,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:41,161 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:41,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:41,172 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:41,406 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:57:41,406 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:41,406 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:41,414 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:41,423 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:41,425 INFO ]: Computing forward predicates... [2018-06-22 11:57:41,527 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:57:41,545 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:41,545 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:57:41,546 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:57:41,546 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:57:41,546 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:57:41,546 INFO ]: Start difference. First operand 17 states and 24 transitions. Second operand 14 states. [2018-06-22 11:57:41,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:41,828 INFO ]: Finished difference Result 29 states and 51 transitions. [2018-06-22 11:57:41,829 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:57:41,829 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 11:57:41,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:41,830 INFO ]: With dead ends: 29 [2018-06-22 11:57:41,830 INFO ]: Without dead ends: 29 [2018-06-22 11:57:41,831 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:57:41,831 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:57:41,837 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-06-22 11:57:41,837 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:57:41,838 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2018-06-22 11:57:41,838 INFO ]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 17 [2018-06-22 11:57:41,838 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:41,838 INFO ]: Abstraction has 21 states and 32 transitions. [2018-06-22 11:57:41,838 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:57:41,838 INFO ]: Start isEmpty. Operand 21 states and 32 transitions. [2018-06-22 11:57:41,839 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:57:41,839 INFO ]: Found error trace [2018-06-22 11:57:41,839 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:41,839 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:41,839 INFO ]: Analyzing trace with hash -2089869745, now seen corresponding path program 1 times [2018-06-22 11:57:41,839 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:41,840 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:41,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:41,840 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:41,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:41,848 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:42,019 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:57:42,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:42,019 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:42,025 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:42,043 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:42,045 INFO ]: Computing forward predicates... [2018-06-22 11:57:42,213 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:57:42,236 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:42,236 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-22 11:57:42,236 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:57:42,236 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:57:42,236 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:57:42,236 INFO ]: Start difference. First operand 21 states and 32 transitions. Second operand 12 states. [2018-06-22 11:57:42,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:42,628 INFO ]: Finished difference Result 29 states and 50 transitions. [2018-06-22 11:57:42,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:57:42,629 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:57:42,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:42,630 INFO ]: With dead ends: 29 [2018-06-22 11:57:42,630 INFO ]: Without dead ends: 29 [2018-06-22 11:57:42,630 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:57:42,630 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:57:42,636 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-06-22 11:57:42,636 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:57:42,636 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-06-22 11:57:42,636 INFO ]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 17 [2018-06-22 11:57:42,637 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:42,637 INFO ]: Abstraction has 21 states and 31 transitions. [2018-06-22 11:57:42,637 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:57:42,637 INFO ]: Start isEmpty. Operand 21 states and 31 transitions. [2018-06-22 11:57:42,637 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:57:42,637 INFO ]: Found error trace [2018-06-22 11:57:42,637 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:42,638 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:42,638 INFO ]: Analyzing trace with hash 152288098, now seen corresponding path program 2 times [2018-06-22 11:57:42,638 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:42,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:42,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:42,638 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:42,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:42,649 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:42,763 INFO ]: Checked inductivity of 19 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:57:42,763 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:42,763 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:42,769 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:42,794 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:42,794 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:42,796 INFO ]: Computing forward predicates... [2018-06-22 11:57:42,909 INFO ]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:57:42,928 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:42,928 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-22 11:57:42,928 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:57:42,928 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:57:42,929 INFO ]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:57:42,929 INFO ]: Start difference. First operand 21 states and 31 transitions. Second operand 17 states. [2018-06-22 11:57:43,189 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-06-22 11:57:43,430 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:43,430 INFO ]: Finished difference Result 35 states and 61 transitions. [2018-06-22 11:57:43,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:57:43,432 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-22 11:57:43,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:43,435 INFO ]: With dead ends: 35 [2018-06-22 11:57:43,435 INFO ]: Without dead ends: 35 [2018-06-22 11:57:43,435 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:57:43,436 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:57:43,450 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-06-22 11:57:43,450 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:57:43,450 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-06-22 11:57:43,450 INFO ]: Start accepts. Automaton has 23 states and 35 transitions. Word has length 21 [2018-06-22 11:57:43,451 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:43,451 INFO ]: Abstraction has 23 states and 35 transitions. [2018-06-22 11:57:43,451 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:57:43,451 INFO ]: Start isEmpty. Operand 23 states and 35 transitions. [2018-06-22 11:57:43,452 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:57:43,452 INFO ]: Found error trace [2018-06-22 11:57:43,452 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:43,452 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:43,452 INFO ]: Analyzing trace with hash -541539688, now seen corresponding path program 3 times [2018-06-22 11:57:43,452 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:43,452 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:43,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:43,453 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:43,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:43,476 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:43,620 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:57:43,620 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:43,620 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:43,625 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:57:43,639 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:57:43,639 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:43,641 INFO ]: Computing forward predicates... [2018-06-22 11:57:43,776 INFO ]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:57:43,795 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:43,795 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-22 11:57:43,796 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:57:43,796 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:57:43,796 INFO ]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:57:43,796 INFO ]: Start difference. First operand 23 states and 35 transitions. Second operand 17 states. [2018-06-22 11:57:44,062 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:44,062 INFO ]: Finished difference Result 45 states and 81 transitions. [2018-06-22 11:57:44,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:57:44,063 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-22 11:57:44,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:44,065 INFO ]: With dead ends: 45 [2018-06-22 11:57:44,065 INFO ]: Without dead ends: 45 [2018-06-22 11:57:44,065 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:57:44,065 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:57:44,074 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 25. [2018-06-22 11:57:44,074 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:57:44,075 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2018-06-22 11:57:44,075 INFO ]: Start accepts. Automaton has 25 states and 39 transitions. Word has length 21 [2018-06-22 11:57:44,075 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:44,075 INFO ]: Abstraction has 25 states and 39 transitions. [2018-06-22 11:57:44,075 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:57:44,075 INFO ]: Start isEmpty. Operand 25 states and 39 transitions. [2018-06-22 11:57:44,076 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:57:44,076 INFO ]: Found error trace [2018-06-22 11:57:44,076 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:44,076 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:44,077 INFO ]: Analyzing trace with hash 1531943539, now seen corresponding path program 2 times [2018-06-22 11:57:44,077 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:44,077 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:44,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:44,077 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:44,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:44,085 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:44,528 WARN ]: Spent 284.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-06-22 11:57:44,584 INFO ]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:57:44,584 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:44,584 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:44,590 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:44,601 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:44,601 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:44,603 INFO ]: Computing forward predicates... [2018-06-22 11:57:44,720 INFO ]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:57:44,740 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:44,740 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-22 11:57:44,740 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:57:44,741 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:57:44,741 INFO ]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:57:44,741 INFO ]: Start difference. First operand 25 states and 39 transitions. Second operand 15 states. [2018-06-22 11:57:44,999 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:44,999 INFO ]: Finished difference Result 39 states and 69 transitions. [2018-06-22 11:57:44,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:57:44,999 INFO ]: Start accepts. Automaton has 15 states. Word has length 21 [2018-06-22 11:57:44,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:45,000 INFO ]: With dead ends: 39 [2018-06-22 11:57:45,000 INFO ]: Without dead ends: 39 [2018-06-22 11:57:45,000 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:57:45,001 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:57:45,006 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 25. [2018-06-22 11:57:45,006 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:57:45,007 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2018-06-22 11:57:45,007 INFO ]: Start accepts. Automaton has 25 states and 38 transitions. Word has length 21 [2018-06-22 11:57:45,007 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:45,007 INFO ]: Abstraction has 25 states and 38 transitions. [2018-06-22 11:57:45,007 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:57:45,007 INFO ]: Start isEmpty. Operand 25 states and 38 transitions. [2018-06-22 11:57:45,008 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:57:45,008 INFO ]: Found error trace [2018-06-22 11:57:45,008 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:45,008 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:45,008 INFO ]: Analyzing trace with hash 1145178448, now seen corresponding path program 4 times [2018-06-22 11:57:45,008 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:45,008 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:45,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:45,009 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:45,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:45,019 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:45,145 INFO ]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:57:45,145 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:45,145 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:45,151 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:57:45,165 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:57:45,165 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:45,167 INFO ]: Computing forward predicates... [2018-06-22 11:57:45,301 INFO ]: Checked inductivity of 33 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:57:45,331 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:45,331 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-22 11:57:45,331 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:57:45,331 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:57:45,331 INFO ]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:57:45,332 INFO ]: Start difference. First operand 25 states and 38 transitions. Second operand 19 states. [2018-06-22 11:57:45,841 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:45,841 INFO ]: Finished difference Result 49 states and 88 transitions. [2018-06-22 11:57:45,841 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:57:45,841 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-22 11:57:45,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:45,842 INFO ]: With dead ends: 49 [2018-06-22 11:57:45,842 INFO ]: Without dead ends: 49 [2018-06-22 11:57:45,843 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:57:45,843 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:57:45,858 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 27. [2018-06-22 11:57:45,858 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:57:45,859 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2018-06-22 11:57:45,859 INFO ]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 25 [2018-06-22 11:57:45,859 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:45,859 INFO ]: Abstraction has 27 states and 42 transitions. [2018-06-22 11:57:45,859 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:57:45,859 INFO ]: Start isEmpty. Operand 27 states and 42 transitions. [2018-06-22 11:57:45,860 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:57:45,860 INFO ]: Found error trace [2018-06-22 11:57:45,860 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:45,860 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:45,860 INFO ]: Analyzing trace with hash 96606982, now seen corresponding path program 5 times [2018-06-22 11:57:45,860 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:45,860 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:45,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:45,861 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:45,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:45,883 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:46,028 INFO ]: Checked inductivity of 32 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:57:46,028 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:46,028 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:46,034 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:57:46,048 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 11:57:46,048 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:46,050 INFO ]: Computing forward predicates... [2018-06-22 11:57:46,243 INFO ]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:57:46,262 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:46,262 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-22 11:57:46,262 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:57:46,263 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:57:46,263 INFO ]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:57:46,263 INFO ]: Start difference. First operand 27 states and 42 transitions. Second operand 20 states. [2018-06-22 11:57:47,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:47,080 INFO ]: Finished difference Result 77 states and 145 transitions. [2018-06-22 11:57:47,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:57:47,081 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 11:57:47,081 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:47,082 INFO ]: With dead ends: 77 [2018-06-22 11:57:47,082 INFO ]: Without dead ends: 77 [2018-06-22 11:57:47,082 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:57:47,083 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 11:57:47,093 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 27. [2018-06-22 11:57:47,093 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:57:47,094 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2018-06-22 11:57:47,094 INFO ]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 25 [2018-06-22 11:57:47,094 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:47,094 INFO ]: Abstraction has 27 states and 42 transitions. [2018-06-22 11:57:47,094 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:57:47,094 INFO ]: Start isEmpty. Operand 27 states and 42 transitions. [2018-06-22 11:57:47,095 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:57:47,095 INFO ]: Found error trace [2018-06-22 11:57:47,095 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:47,095 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:47,095 INFO ]: Analyzing trace with hash -1518668137, now seen corresponding path program 3 times [2018-06-22 11:57:47,095 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:47,095 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:47,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:47,096 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:47,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:47,104 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:47,208 INFO ]: Checked inductivity of 33 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:57:47,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:47,208 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:47,214 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:57:47,274 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:57:47,274 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:47,276 INFO ]: Computing forward predicates... [2018-06-22 11:57:47,514 INFO ]: Checked inductivity of 33 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:57:47,532 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:47,532 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-06-22 11:57:47,532 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:57:47,533 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:57:47,533 INFO ]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:57:47,533 INFO ]: Start difference. First operand 27 states and 42 transitions. Second operand 17 states. [2018-06-22 11:57:47,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:47,868 INFO ]: Finished difference Result 49 states and 88 transitions. [2018-06-22 11:57:47,868 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:57:47,868 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-22 11:57:47,868 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:47,869 INFO ]: With dead ends: 49 [2018-06-22 11:57:47,869 INFO ]: Without dead ends: 49 [2018-06-22 11:57:47,869 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:57:47,869 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:57:47,875 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 29. [2018-06-22 11:57:47,875 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:57:47,875 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2018-06-22 11:57:47,875 INFO ]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 25 [2018-06-22 11:57:47,875 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:47,876 INFO ]: Abstraction has 29 states and 45 transitions. [2018-06-22 11:57:47,876 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:57:47,876 INFO ]: Start isEmpty. Operand 29 states and 45 transitions. [2018-06-22 11:57:47,876 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:57:47,876 INFO ]: Found error trace [2018-06-22 11:57:47,876 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:47,877 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:47,877 INFO ]: Analyzing trace with hash -398281412, now seen corresponding path program 6 times [2018-06-22 11:57:47,877 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:47,877 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:47,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:47,877 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:47,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:47,885 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:48,052 INFO ]: Checked inductivity of 33 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:57:48,052 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:48,052 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:48,059 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:57:48,132 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:57:48,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:48,135 INFO ]: Computing forward predicates... [2018-06-22 11:57:48,437 INFO ]: Checked inductivity of 33 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:57:48,456 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:48,456 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-22 11:57:48,456 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:57:48,456 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:57:48,456 INFO ]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:57:48,457 INFO ]: Start difference. First operand 29 states and 45 transitions. Second operand 19 states. [2018-06-22 11:57:48,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:48,972 INFO ]: Finished difference Result 59 states and 107 transitions. [2018-06-22 11:57:48,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:57:48,972 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-22 11:57:48,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:48,973 INFO ]: With dead ends: 59 [2018-06-22 11:57:48,973 INFO ]: Without dead ends: 59 [2018-06-22 11:57:48,973 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:57:48,974 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 11:57:48,979 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 29. [2018-06-22 11:57:48,979 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:57:48,980 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2018-06-22 11:57:48,980 INFO ]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 25 [2018-06-22 11:57:48,980 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:48,980 INFO ]: Abstraction has 29 states and 45 transitions. [2018-06-22 11:57:48,980 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:57:48,980 INFO ]: Start isEmpty. Operand 29 states and 45 transitions. [2018-06-22 11:57:48,981 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:57:48,981 INFO ]: Found error trace [2018-06-22 11:57:48,981 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:48,981 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:48,981 INFO ]: Analyzing trace with hash -1602504258, now seen corresponding path program 7 times [2018-06-22 11:57:48,981 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:48,981 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:48,982 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:48,982 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:48,982 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:48,990 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:49,386 INFO ]: Checked inductivity of 51 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:57:49,386 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:49,386 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:57:49,391 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:49,418 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:49,421 INFO ]: Computing forward predicates... [2018-06-22 11:57:49,702 INFO ]: Checked inductivity of 51 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:57:49,721 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:49,721 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-06-22 11:57:49,722 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:57:49,722 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:57:49,722 INFO ]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:57:49,722 INFO ]: Start difference. First operand 29 states and 45 transitions. Second operand 21 states. [2018-06-22 11:57:50,520 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:50,520 INFO ]: Finished difference Result 65 states and 119 transitions. [2018-06-22 11:57:50,544 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:57:50,544 INFO ]: Start accepts. Automaton has 21 states. Word has length 29 [2018-06-22 11:57:50,545 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:50,546 INFO ]: With dead ends: 65 [2018-06-22 11:57:50,546 INFO ]: Without dead ends: 65 [2018-06-22 11:57:50,546 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:57:50,546 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:57:50,556 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 31. [2018-06-22 11:57:50,556 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:57:50,559 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2018-06-22 11:57:50,559 INFO ]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 29 [2018-06-22 11:57:50,559 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:50,559 INFO ]: Abstraction has 31 states and 49 transitions. [2018-06-22 11:57:50,559 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:57:50,559 INFO ]: Start isEmpty. Operand 31 states and 49 transitions. [2018-06-22 11:57:50,560 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:57:50,560 INFO ]: Found error trace [2018-06-22 11:57:50,560 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:50,560 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:50,560 INFO ]: Analyzing trace with hash -60509509, now seen corresponding path program 4 times [2018-06-22 11:57:50,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:50,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:50,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:50,560 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:50,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:50,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:50,715 INFO ]: Checked inductivity of 51 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:57:50,715 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:50,715 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:50,721 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:57:50,733 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:57:50,733 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:50,736 INFO ]: Computing forward predicates... [2018-06-22 11:57:50,930 INFO ]: Checked inductivity of 51 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:57:50,948 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:50,948 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-06-22 11:57:50,949 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:57:50,949 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:57:50,949 INFO ]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:57:50,949 INFO ]: Start difference. First operand 31 states and 49 transitions. Second operand 19 states. [2018-06-22 11:57:51,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:51,376 INFO ]: Finished difference Result 57 states and 103 transitions. [2018-06-22 11:57:51,377 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:57:51,377 INFO ]: Start accepts. Automaton has 19 states. Word has length 29 [2018-06-22 11:57:51,377 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:51,378 INFO ]: With dead ends: 57 [2018-06-22 11:57:51,378 INFO ]: Without dead ends: 57 [2018-06-22 11:57:51,378 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:57:51,378 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:57:51,383 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 33. [2018-06-22 11:57:51,384 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:57:51,384 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2018-06-22 11:57:51,384 INFO ]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 29 [2018-06-22 11:57:51,385 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:51,385 INFO ]: Abstraction has 33 states and 52 transitions. [2018-06-22 11:57:51,385 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:57:51,385 INFO ]: Start isEmpty. Operand 33 states and 52 transitions. [2018-06-22 11:57:51,385 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:57:51,385 INFO ]: Found error trace [2018-06-22 11:57:51,385 INFO ]: trace histogram [6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:51,386 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:51,386 INFO ]: Analyzing trace with hash 37631476, now seen corresponding path program 8 times [2018-06-22 11:57:51,386 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:51,386 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:51,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:51,386 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:51,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:51,393 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:51,552 INFO ]: Checked inductivity of 49 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:57:51,553 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:51,553 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:51,558 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:51,571 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:51,571 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:51,574 INFO ]: Computing forward predicates... [2018-06-22 11:57:51,724 INFO ]: Checked inductivity of 49 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:57:51,743 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:51,743 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-06-22 11:57:51,744 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:57:51,744 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:57:51,744 INFO ]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:57:51,744 INFO ]: Start difference. First operand 33 states and 52 transitions. Second operand 22 states. [2018-06-22 11:57:52,354 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:52,354 INFO ]: Finished difference Result 93 states and 174 transitions. [2018-06-22 11:57:52,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:57:52,354 INFO ]: Start accepts. Automaton has 22 states. Word has length 29 [2018-06-22 11:57:52,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:52,355 INFO ]: With dead ends: 93 [2018-06-22 11:57:52,355 INFO ]: Without dead ends: 93 [2018-06-22 11:57:52,356 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:57:52,356 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:57:52,369 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 33. [2018-06-22 11:57:52,369 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:57:52,370 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2018-06-22 11:57:52,370 INFO ]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 29 [2018-06-22 11:57:52,370 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:52,370 INFO ]: Abstraction has 33 states and 52 transitions. [2018-06-22 11:57:52,370 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:57:52,370 INFO ]: Start isEmpty. Operand 33 states and 52 transitions. [2018-06-22 11:57:52,371 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:57:52,371 INFO ]: Found error trace [2018-06-22 11:57:52,371 INFO ]: trace histogram [6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:52,371 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:52,371 INFO ]: Analyzing trace with hash 1191254698, now seen corresponding path program 9 times [2018-06-22 11:57:52,371 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:52,371 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:52,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:52,372 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:52,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:52,378 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:52,673 INFO ]: Checked inductivity of 49 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:57:52,673 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:52,673 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:52,679 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:57:52,694 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:57:52,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:52,696 INFO ]: Computing forward predicates... [2018-06-22 11:57:52,872 INFO ]: Checked inductivity of 49 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:57:52,890 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:52,890 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-06-22 11:57:52,891 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:57:52,891 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:57:52,891 INFO ]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:57:52,891 INFO ]: Start difference. First operand 33 states and 52 transitions. Second operand 22 states. [2018-06-22 11:57:53,489 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:53,489 INFO ]: Finished difference Result 93 states and 174 transitions. [2018-06-22 11:57:53,489 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:57:53,489 INFO ]: Start accepts. Automaton has 22 states. Word has length 29 [2018-06-22 11:57:53,489 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:53,490 INFO ]: With dead ends: 93 [2018-06-22 11:57:53,490 INFO ]: Without dead ends: 93 [2018-06-22 11:57:53,490 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=236, Invalid=1024, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:57:53,490 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:57:53,497 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 33. [2018-06-22 11:57:53,497 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:57:53,498 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2018-06-22 11:57:53,498 INFO ]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 29 [2018-06-22 11:57:53,498 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:53,498 INFO ]: Abstraction has 33 states and 52 transitions. [2018-06-22 11:57:53,498 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:57:53,498 INFO ]: Start isEmpty. Operand 33 states and 52 transitions. [2018-06-22 11:57:53,499 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:57:53,499 INFO ]: Found error trace [2018-06-22 11:57:53,499 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:53,499 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:53,499 INFO ]: Analyzing trace with hash -413415456, now seen corresponding path program 10 times [2018-06-22 11:57:53,499 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:53,499 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:53,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:53,500 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:53,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:53,506 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:53,811 INFO ]: Checked inductivity of 51 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:57:53,812 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:53,812 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:53,818 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:57:53,829 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:57:53,829 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:53,831 INFO ]: Computing forward predicates... [2018-06-22 11:57:53,992 INFO ]: Checked inductivity of 51 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:57:54,011 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:54,011 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-06-22 11:57:54,011 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:57:54,011 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:57:54,011 INFO ]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:57:54,011 INFO ]: Start difference. First operand 33 states and 52 transitions. Second operand 21 states. [2018-06-22 11:57:54,541 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:54,541 INFO ]: Finished difference Result 73 states and 134 transitions. [2018-06-22 11:57:54,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:57:54,542 INFO ]: Start accepts. Automaton has 21 states. Word has length 29 [2018-06-22 11:57:54,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:54,542 INFO ]: With dead ends: 73 [2018-06-22 11:57:54,542 INFO ]: Without dead ends: 73 [2018-06-22 11:57:54,543 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:57:54,543 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 11:57:54,548 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 33. [2018-06-22 11:57:54,548 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:57:54,549 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2018-06-22 11:57:54,549 INFO ]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 29 [2018-06-22 11:57:54,549 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:54,549 INFO ]: Abstraction has 33 states and 52 transitions. [2018-06-22 11:57:54,549 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:57:54,549 INFO ]: Start isEmpty. Operand 33 states and 52 transitions. [2018-06-22 11:57:54,550 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:57:54,550 INFO ]: Found error trace [2018-06-22 11:57:54,550 INFO ]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:54,550 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:54,550 INFO ]: Analyzing trace with hash 342830252, now seen corresponding path program 11 times [2018-06-22 11:57:54,550 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:54,550 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:54,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:54,551 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:54,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:54,562 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:54,928 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:57:55,298 WARN ]: Spent 273.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-06-22 11:57:55,497 INFO ]: Checked inductivity of 73 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:57:55,497 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:55,497 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:55,508 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:57:55,528 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 11:57:55,528 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:55,554 INFO ]: Computing forward predicates... [2018-06-22 11:57:55,827 INFO ]: Checked inductivity of 73 backedges. 3 proven. 46 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:57:55,846 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:55,846 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2018-06-22 11:57:55,846 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:57:55,847 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:57:55,847 INFO ]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:57:55,847 INFO ]: Start difference. First operand 33 states and 52 transitions. Second operand 24 states. [2018-06-22 11:57:57,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:57,037 INFO ]: Finished difference Result 99 states and 188 transitions. [2018-06-22 11:57:57,037 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:57:57,037 INFO ]: Start accepts. Automaton has 24 states. Word has length 33 [2018-06-22 11:57:57,037 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:57,038 INFO ]: With dead ends: 99 [2018-06-22 11:57:57,038 INFO ]: Without dead ends: 99 [2018-06-22 11:57:57,039 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=287, Invalid=1875, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:57:57,039 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-22 11:57:57,045 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 35. [2018-06-22 11:57:57,045 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:57:57,046 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2018-06-22 11:57:57,046 INFO ]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 33 [2018-06-22 11:57:57,046 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:57,046 INFO ]: Abstraction has 35 states and 56 transitions. [2018-06-22 11:57:57,046 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:57:57,046 INFO ]: Start isEmpty. Operand 35 states and 56 transitions. [2018-06-22 11:57:57,047 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:57:57,047 INFO ]: Found error trace [2018-06-22 11:57:57,047 INFO ]: trace histogram [7, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:57,047 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:57,047 INFO ]: Analyzing trace with hash 260272994, now seen corresponding path program 12 times [2018-06-22 11:57:57,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:57,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:57,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:57,048 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:57,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:57,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:57,329 INFO ]: Checked inductivity of 70 backedges. 3 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:57:57,329 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:57,329 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:57,336 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:57:57,349 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:57:57,349 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:57,350 INFO ]: Computing forward predicates... [2018-06-22 11:57:57,420 INFO ]: Checked inductivity of 70 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:57:57,442 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:57,443 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-06-22 11:57:57,443 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:57:57,443 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:57:57,443 INFO ]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:57:57,443 INFO ]: Start difference. First operand 35 states and 56 transitions. Second operand 19 states. [2018-06-22 11:57:57,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:57,645 INFO ]: Finished difference Result 43 states and 73 transitions. [2018-06-22 11:57:57,646 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:57:57,646 INFO ]: Start accepts. Automaton has 19 states. Word has length 33 [2018-06-22 11:57:57,646 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:57,647 INFO ]: With dead ends: 43 [2018-06-22 11:57:57,647 INFO ]: Without dead ends: 43 [2018-06-22 11:57:57,647 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:57:57,647 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:57:57,652 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 29. [2018-06-22 11:57:57,652 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:57:57,652 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2018-06-22 11:57:57,652 INFO ]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 33 [2018-06-22 11:57:57,652 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:57,652 INFO ]: Abstraction has 29 states and 42 transitions. [2018-06-22 11:57:57,652 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:57:57,653 INFO ]: Start isEmpty. Operand 29 states and 42 transitions. [2018-06-22 11:57:57,653 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:57:57,653 INFO ]: Found error trace [2018-06-22 11:57:57,653 INFO ]: trace histogram [7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:57,653 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:57,653 INFO ]: Analyzing trace with hash 790626968, now seen corresponding path program 13 times [2018-06-22 11:57:57,653 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:57,653 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:57,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:57,654 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:57:57,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:57,666 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:57,952 INFO ]: Checked inductivity of 69 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:57:57,952 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:57,952 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:57,958 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:57,983 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:57,985 INFO ]: Computing forward predicates... [2018-06-22 11:57:58,184 INFO ]: Checked inductivity of 69 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:57:58,203 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:58,203 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-06-22 11:57:58,204 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:57:58,204 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:57:58,204 INFO ]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:57:58,204 INFO ]: Start difference. First operand 29 states and 42 transitions. Second operand 24 states. [2018-06-22 11:57:58,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:57:58,636 INFO ]: Finished difference Result 53 states and 92 transitions. [2018-06-22 11:57:58,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:57:58,637 INFO ]: Start accepts. Automaton has 24 states. Word has length 33 [2018-06-22 11:57:58,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:57:58,638 INFO ]: With dead ends: 53 [2018-06-22 11:57:58,638 INFO ]: Without dead ends: 53 [2018-06-22 11:57:58,638 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:57:58,638 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:57:58,642 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 31. [2018-06-22 11:57:58,642 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:57:58,642 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2018-06-22 11:57:58,642 INFO ]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 33 [2018-06-22 11:57:58,643 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:57:58,643 INFO ]: Abstraction has 31 states and 46 transitions. [2018-06-22 11:57:58,643 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:57:58,643 INFO ]: Start isEmpty. Operand 31 states and 46 transitions. [2018-06-22 11:57:58,643 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:57:58,643 INFO ]: Found error trace [2018-06-22 11:57:58,643 INFO ]: trace histogram [7, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:57:58,643 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:57:58,643 INFO ]: Analyzing trace with hash 595868238, now seen corresponding path program 14 times [2018-06-22 11:57:58,643 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:57:58,643 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:57:58,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:58,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:57:58,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:57:58,651 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:59,246 INFO ]: Checked inductivity of 70 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:57:59,246 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:57:59,246 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:57:59,251 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:57:59,265 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:57:59,265 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:57:59,267 INFO ]: Computing forward predicates... [2018-06-22 11:57:59,862 INFO ]: Checked inductivity of 70 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:57:59,880 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:57:59,880 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-06-22 11:57:59,880 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:57:59,881 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:57:59,881 INFO ]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:57:59,881 INFO ]: Start difference. First operand 31 states and 46 transitions. Second operand 24 states. [2018-06-22 11:58:00,386 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:00,386 INFO ]: Finished difference Result 71 states and 128 transitions. [2018-06-22 11:58:00,387 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:58:00,387 INFO ]: Start accepts. Automaton has 24 states. Word has length 33 [2018-06-22 11:58:00,387 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:00,388 INFO ]: With dead ends: 71 [2018-06-22 11:58:00,388 INFO ]: Without dead ends: 71 [2018-06-22 11:58:00,388 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=223, Invalid=1037, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:58:00,388 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:58:00,395 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 31. [2018-06-22 11:58:00,396 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:58:00,396 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2018-06-22 11:58:00,396 INFO ]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 33 [2018-06-22 11:58:00,396 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:00,396 INFO ]: Abstraction has 31 states and 46 transitions. [2018-06-22 11:58:00,396 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:58:00,396 INFO ]: Start isEmpty. Operand 31 states and 46 transitions. [2018-06-22 11:58:00,400 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:58:00,400 INFO ]: Found error trace [2018-06-22 11:58:00,400 INFO ]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:00,400 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:00,400 INFO ]: Analyzing trace with hash 276265604, now seen corresponding path program 15 times [2018-06-22 11:58:00,400 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:00,400 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:00,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:00,401 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:00,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:00,410 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:00,709 WARN ]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:58:01,343 INFO ]: Checked inductivity of 73 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:58:01,343 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:01,343 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:01,349 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:58:01,368 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 11:58:01,368 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:01,371 INFO ]: Computing forward predicates... [2018-06-22 11:58:01,817 INFO ]: Checked inductivity of 73 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:58:01,835 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:01,835 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-06-22 11:58:01,835 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:58:01,835 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:58:01,835 INFO ]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:58:01,836 INFO ]: Start difference. First operand 31 states and 46 transitions. Second operand 23 states. [2018-06-22 11:58:02,180 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:02,180 INFO ]: Finished difference Result 63 states and 112 transitions. [2018-06-22 11:58:02,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:58:02,181 INFO ]: Start accepts. Automaton has 23 states. Word has length 33 [2018-06-22 11:58:02,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:02,182 INFO ]: With dead ends: 63 [2018-06-22 11:58:02,182 INFO ]: Without dead ends: 63 [2018-06-22 11:58:02,182 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:58:02,182 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:58:02,187 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 33. [2018-06-22 11:58:02,187 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:58:02,189 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2018-06-22 11:58:02,189 INFO ]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 33 [2018-06-22 11:58:02,189 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:02,189 INFO ]: Abstraction has 33 states and 50 transitions. [2018-06-22 11:58:02,189 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:58:02,189 INFO ]: Start isEmpty. Operand 33 states and 50 transitions. [2018-06-22 11:58:02,189 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:58:02,189 INFO ]: Found error trace [2018-06-22 11:58:02,189 INFO ]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:02,190 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:02,190 INFO ]: Analyzing trace with hash 1776307935, now seen corresponding path program 5 times [2018-06-22 11:58:02,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:02,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:02,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:02,190 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:02,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:02,196 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:02,399 INFO ]: Checked inductivity of 73 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:58:02,399 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:02,399 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:02,405 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:58:02,420 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 11:58:02,420 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:02,423 INFO ]: Computing forward predicates... [2018-06-22 11:58:02,568 INFO ]: Checked inductivity of 73 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:58:02,588 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:02,588 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-06-22 11:58:02,588 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:58:02,588 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:58:02,588 INFO ]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:58:02,588 INFO ]: Start difference. First operand 33 states and 50 transitions. Second operand 20 states. [2018-06-22 11:58:02,943 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:02,943 INFO ]: Finished difference Result 53 states and 92 transitions. [2018-06-22 11:58:02,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:58:02,945 INFO ]: Start accepts. Automaton has 20 states. Word has length 33 [2018-06-22 11:58:02,945 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:02,946 INFO ]: With dead ends: 53 [2018-06-22 11:58:02,946 INFO ]: Without dead ends: 53 [2018-06-22 11:58:02,946 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:58:02,946 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:58:02,950 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 33. [2018-06-22 11:58:02,950 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:58:02,950 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-06-22 11:58:02,950 INFO ]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 33 [2018-06-22 11:58:02,950 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:02,950 INFO ]: Abstraction has 33 states and 49 transitions. [2018-06-22 11:58:02,950 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:58:02,950 INFO ]: Start isEmpty. Operand 33 states and 49 transitions. [2018-06-22 11:58:02,951 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:58:02,951 INFO ]: Found error trace [2018-06-22 11:58:02,951 INFO ]: trace histogram [8, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:02,951 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:02,951 INFO ]: Analyzing trace with hash -1878668026, now seen corresponding path program 16 times [2018-06-22 11:58:02,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:02,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:02,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:02,952 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:02,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:02,959 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:03,120 INFO ]: Checked inductivity of 93 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:58:03,120 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:03,120 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:03,126 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:58:03,140 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:58:03,140 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:03,142 INFO ]: Computing forward predicates... [2018-06-22 11:58:03,364 INFO ]: Checked inductivity of 93 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:58:03,382 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:03,382 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2018-06-22 11:58:03,382 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:58:03,383 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:58:03,383 INFO ]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:58:03,383 INFO ]: Start difference. First operand 33 states and 49 transitions. Second operand 26 states. [2018-06-22 11:58:03,871 WARN ]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 11:58:04,853 WARN ]: Spent 399.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-06-22 11:58:05,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:05,128 INFO ]: Finished difference Result 69 states and 123 transitions. [2018-06-22 11:58:05,128 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:58:05,128 INFO ]: Start accepts. Automaton has 26 states. Word has length 37 [2018-06-22 11:58:05,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:05,129 INFO ]: With dead ends: 69 [2018-06-22 11:58:05,129 INFO ]: Without dead ends: 69 [2018-06-22 11:58:05,129 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=229, Invalid=1253, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:58:05,130 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:58:05,134 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 35. [2018-06-22 11:58:05,135 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:58:05,135 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2018-06-22 11:58:05,135 INFO ]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 37 [2018-06-22 11:58:05,135 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:05,135 INFO ]: Abstraction has 35 states and 53 transitions. [2018-06-22 11:58:05,136 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:58:05,136 INFO ]: Start isEmpty. Operand 35 states and 53 transitions. [2018-06-22 11:58:05,137 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:58:05,137 INFO ]: Found error trace [2018-06-22 11:58:05,137 INFO ]: trace histogram [8, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:05,137 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:05,137 INFO ]: Analyzing trace with hash -63246532, now seen corresponding path program 17 times [2018-06-22 11:58:05,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:05,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:05,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:05,138 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:05,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:05,145 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:05,322 INFO ]: Checked inductivity of 93 backedges. 2 proven. 59 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:58:05,322 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:05,322 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:05,337 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:58:05,370 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 11:58:05,370 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:05,373 INFO ]: Computing forward predicates... [2018-06-22 11:58:05,501 INFO ]: Checked inductivity of 93 backedges. 26 proven. 31 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:58:05,521 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:05,521 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-06-22 11:58:05,521 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:58:05,521 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:58:05,521 INFO ]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:58:05,522 INFO ]: Start difference. First operand 35 states and 53 transitions. Second operand 24 states. [2018-06-22 11:58:06,067 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:06,067 INFO ]: Finished difference Result 60 states and 93 transitions. [2018-06-22 11:58:06,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:58:06,067 INFO ]: Start accepts. Automaton has 24 states. Word has length 37 [2018-06-22 11:58:06,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:06,068 INFO ]: With dead ends: 60 [2018-06-22 11:58:06,068 INFO ]: Without dead ends: 50 [2018-06-22 11:58:06,069 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=1096, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:58:06,069 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:58:06,074 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 40. [2018-06-22 11:58:06,074 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:58:06,074 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2018-06-22 11:58:06,074 INFO ]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 37 [2018-06-22 11:58:06,075 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:06,075 INFO ]: Abstraction has 40 states and 65 transitions. [2018-06-22 11:58:06,075 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:58:06,075 INFO ]: Start isEmpty. Operand 40 states and 65 transitions. [2018-06-22 11:58:06,076 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:58:06,076 INFO ]: Found error trace [2018-06-22 11:58:06,076 INFO ]: trace histogram [8, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:06,076 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:06,076 INFO ]: Analyzing trace with hash -623970904, now seen corresponding path program 18 times [2018-06-22 11:58:06,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:06,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:06,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:06,077 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:06,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:06,088 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:06,131 INFO ]: Checked inductivity of 99 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:58:06,131 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:06,131 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:06,139 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:58:06,157 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:58:06,157 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:06,158 INFO ]: Computing forward predicates... [2018-06-22 11:58:06,176 INFO ]: Checked inductivity of 99 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:58:06,195 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:06,195 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 11:58:06,195 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:58:06,195 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:58:06,195 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:58:06,195 INFO ]: Start difference. First operand 40 states and 65 transitions. Second operand 5 states. [2018-06-22 11:58:06,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:06,247 INFO ]: Finished difference Result 44 states and 69 transitions. [2018-06-22 11:58:06,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:58:06,248 INFO ]: Start accepts. Automaton has 5 states. Word has length 37 [2018-06-22 11:58:06,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:06,248 INFO ]: With dead ends: 44 [2018-06-22 11:58:06,248 INFO ]: Without dead ends: 44 [2018-06-22 11:58:06,249 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:58:06,249 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:58:06,252 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-06-22 11:58:06,252 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:58:06,253 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 61 transitions. [2018-06-22 11:58:06,253 INFO ]: Start accepts. Automaton has 40 states and 61 transitions. Word has length 37 [2018-06-22 11:58:06,253 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:06,253 INFO ]: Abstraction has 40 states and 61 transitions. [2018-06-22 11:58:06,253 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:58:06,253 INFO ]: Start isEmpty. Operand 40 states and 61 transitions. [2018-06-22 11:58:06,255 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:58:06,255 INFO ]: Found error trace [2018-06-22 11:58:06,255 INFO ]: trace histogram [8, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:06,255 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:06,255 INFO ]: Analyzing trace with hash 2036267506, now seen corresponding path program 19 times [2018-06-22 11:58:06,255 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:06,255 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:06,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:06,256 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:06,256 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:06,264 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:06,479 INFO ]: Checked inductivity of 95 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:58:06,479 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:06,479 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:06,486 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:06,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:06,505 INFO ]: Computing forward predicates... [2018-06-22 11:58:06,794 INFO ]: Checked inductivity of 95 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 11:58:06,813 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:06,814 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2018-06-22 11:58:06,814 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:58:06,814 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:58:06,814 INFO ]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:58:06,814 INFO ]: Start difference. First operand 40 states and 61 transitions. Second operand 26 states. [2018-06-22 11:58:07,835 WARN ]: Spent 387.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-06-22 11:58:08,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:08,069 INFO ]: Finished difference Result 58 states and 93 transitions. [2018-06-22 11:58:08,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:58:08,069 INFO ]: Start accepts. Automaton has 26 states. Word has length 37 [2018-06-22 11:58:08,069 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:08,070 INFO ]: With dead ends: 58 [2018-06-22 11:58:08,070 INFO ]: Without dead ends: 58 [2018-06-22 11:58:08,070 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=224, Invalid=966, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:58:08,070 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:58:08,073 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 46. [2018-06-22 11:58:08,074 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:58:08,074 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 72 transitions. [2018-06-22 11:58:08,074 INFO ]: Start accepts. Automaton has 46 states and 72 transitions. Word has length 37 [2018-06-22 11:58:08,074 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:08,074 INFO ]: Abstraction has 46 states and 72 transitions. [2018-06-22 11:58:08,074 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:58:08,075 INFO ]: Start isEmpty. Operand 46 states and 72 transitions. [2018-06-22 11:58:08,075 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:58:08,076 INFO ]: Found error trace [2018-06-22 11:58:08,076 INFO ]: trace histogram [8, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:08,076 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:08,076 INFO ]: Analyzing trace with hash -283030781, now seen corresponding path program 6 times [2018-06-22 11:58:08,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:08,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:08,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:08,076 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:08,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:08,087 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:08,430 WARN ]: Spent 297.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-06-22 11:58:08,784 INFO ]: Checked inductivity of 99 backedges. 14 proven. 47 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:58:08,784 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:08,784 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:08,790 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:58:08,808 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:58:08,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:08,811 INFO ]: Computing forward predicates... [2018-06-22 11:58:09,157 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 11:58:09,238 INFO ]: Checked inductivity of 99 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:58:09,261 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:09,261 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-06-22 11:58:09,261 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:58:09,261 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:58:09,261 INFO ]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:58:09,262 INFO ]: Start difference. First operand 46 states and 72 transitions. Second operand 19 states. [2018-06-22 11:58:09,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:09,486 INFO ]: Finished difference Result 56 states and 90 transitions. [2018-06-22 11:58:09,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:58:09,486 INFO ]: Start accepts. Automaton has 19 states. Word has length 37 [2018-06-22 11:58:09,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:09,486 INFO ]: With dead ends: 56 [2018-06-22 11:58:09,486 INFO ]: Without dead ends: 56 [2018-06-22 11:58:09,487 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:58:09,487 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:58:09,490 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-06-22 11:58:09,491 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:58:09,491 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 75 transitions. [2018-06-22 11:58:09,491 INFO ]: Start accepts. Automaton has 48 states and 75 transitions. Word has length 37 [2018-06-22 11:58:09,491 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:09,491 INFO ]: Abstraction has 48 states and 75 transitions. [2018-06-22 11:58:09,491 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:58:09,491 INFO ]: Start isEmpty. Operand 48 states and 75 transitions. [2018-06-22 11:58:09,492 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:58:09,492 INFO ]: Found error trace [2018-06-22 11:58:09,492 INFO ]: trace histogram [8, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:09,492 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:09,492 INFO ]: Analyzing trace with hash -1100395224, now seen corresponding path program 20 times [2018-06-22 11:58:09,492 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:09,492 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:09,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:09,493 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:09,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:09,499 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:09,819 WARN ]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:58:09,962 INFO ]: Checked inductivity of 99 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:58:09,962 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:09,962 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:09,968 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:58:09,983 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:58:09,983 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:09,985 INFO ]: Computing forward predicates... [2018-06-22 11:58:10,690 INFO ]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:58:10,709 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:10,709 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-06-22 11:58:10,709 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:58:10,709 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:58:10,709 INFO ]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:58:10,709 INFO ]: Start difference. First operand 48 states and 75 transitions. Second operand 25 states. [2018-06-22 11:58:11,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:11,093 INFO ]: Finished difference Result 66 states and 110 transitions. [2018-06-22 11:58:11,093 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:58:11,093 INFO ]: Start accepts. Automaton has 25 states. Word has length 37 [2018-06-22 11:58:11,093 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:11,094 INFO ]: With dead ends: 66 [2018-06-22 11:58:11,094 INFO ]: Without dead ends: 66 [2018-06-22 11:58:11,095 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:58:11,095 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:58:11,098 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 48. [2018-06-22 11:58:11,098 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:58:11,099 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 75 transitions. [2018-06-22 11:58:11,099 INFO ]: Start accepts. Automaton has 48 states and 75 transitions. Word has length 37 [2018-06-22 11:58:11,099 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:11,099 INFO ]: Abstraction has 48 states and 75 transitions. [2018-06-22 11:58:11,099 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:58:11,099 INFO ]: Start isEmpty. Operand 48 states and 75 transitions. [2018-06-22 11:58:11,100 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:58:11,100 INFO ]: Found error trace [2018-06-22 11:58:11,100 INFO ]: trace histogram [9, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:11,100 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:11,100 INFO ]: Analyzing trace with hash 213591847, now seen corresponding path program 7 times [2018-06-22 11:58:11,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:11,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:11,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:11,100 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:11,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:11,110 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:11,361 WARN ]: Spent 198.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-06-22 11:58:11,461 INFO ]: Checked inductivity of 129 backedges. 16 proven. 62 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-22 11:58:11,461 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:11,461 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:11,466 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:11,482 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:11,485 INFO ]: Computing forward predicates... [2018-06-22 11:58:11,758 INFO ]: Checked inductivity of 129 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:58:11,777 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:11,777 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-06-22 11:58:11,777 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:58:11,777 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:58:11,777 INFO ]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:58:11,778 INFO ]: Start difference. First operand 48 states and 75 transitions. Second operand 25 states. [2018-06-22 11:58:12,160 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:12,160 INFO ]: Finished difference Result 66 states and 106 transitions. [2018-06-22 11:58:12,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:58:12,160 INFO ]: Start accepts. Automaton has 25 states. Word has length 41 [2018-06-22 11:58:12,161 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:12,161 INFO ]: With dead ends: 66 [2018-06-22 11:58:12,161 INFO ]: Without dead ends: 66 [2018-06-22 11:58:12,162 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:58:12,162 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:58:12,166 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-06-22 11:58:12,166 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:58:12,167 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 78 transitions. [2018-06-22 11:58:12,167 INFO ]: Start accepts. Automaton has 50 states and 78 transitions. Word has length 41 [2018-06-22 11:58:12,167 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:12,167 INFO ]: Abstraction has 50 states and 78 transitions. [2018-06-22 11:58:12,167 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:58:12,167 INFO ]: Start isEmpty. Operand 50 states and 78 transitions. [2018-06-22 11:58:12,168 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:58:12,168 INFO ]: Found error trace [2018-06-22 11:58:12,168 INFO ]: trace histogram [9, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:12,168 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:12,168 INFO ]: Analyzing trace with hash -77283380, now seen corresponding path program 21 times [2018-06-22 11:58:12,168 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:12,168 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:12,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:12,169 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:12,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:12,178 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:12,478 WARN ]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:58:12,992 WARN ]: Spent 267.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-06-22 11:58:13,776 INFO ]: Checked inductivity of 129 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-22 11:58:13,776 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:13,776 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:13,781 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:58:13,801 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 11:58:13,801 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:13,804 INFO ]: Computing forward predicates... [2018-06-22 11:58:13,967 INFO ]: Checked inductivity of 129 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:58:13,986 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:13,986 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2018-06-22 11:58:13,986 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:58:13,986 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:58:13,987 INFO ]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:58:13,987 INFO ]: Start difference. First operand 50 states and 78 transitions. Second operand 25 states. [2018-06-22 11:58:14,265 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:14,265 INFO ]: Finished difference Result 48 states and 67 transitions. [2018-06-22 11:58:14,266 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:58:14,266 INFO ]: Start accepts. Automaton has 25 states. Word has length 41 [2018-06-22 11:58:14,266 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:14,266 INFO ]: With dead ends: 48 [2018-06-22 11:58:14,266 INFO ]: Without dead ends: 42 [2018-06-22 11:58:14,267 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=188, Invalid=868, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:58:14,267 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:58:14,269 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-06-22 11:58:14,269 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:58:14,270 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2018-06-22 11:58:14,270 INFO ]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 41 [2018-06-22 11:58:14,270 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:14,270 INFO ]: Abstraction has 38 states and 53 transitions. [2018-06-22 11:58:14,270 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:58:14,270 INFO ]: Start isEmpty. Operand 38 states and 53 transitions. [2018-06-22 11:58:14,270 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:58:14,270 INFO ]: Found error trace [2018-06-22 11:58:14,270 INFO ]: trace histogram [10, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:14,270 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:14,271 INFO ]: Analyzing trace with hash 1252090699, now seen corresponding path program 8 times [2018-06-22 11:58:14,271 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:14,271 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:14,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:14,271 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:14,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:14,279 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:14,483 WARN ]: Spent 152.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-06-22 11:58:14,618 INFO ]: Checked inductivity of 163 backedges. 18 proven. 79 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 11:58:14,618 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:14,618 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:14,623 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:58:14,647 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:58:14,647 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:14,650 INFO ]: Computing forward predicates... [2018-06-22 11:58:14,911 INFO ]: Checked inductivity of 163 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-22 11:58:14,930 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:14,930 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-06-22 11:58:14,930 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:58:14,931 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:58:14,931 INFO ]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:58:14,931 INFO ]: Start difference. First operand 38 states and 53 transitions. Second operand 27 states. [2018-06-22 11:58:15,536 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:15,536 INFO ]: Finished difference Result 50 states and 73 transitions. [2018-06-22 11:58:15,536 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:58:15,536 INFO ]: Start accepts. Automaton has 27 states. Word has length 45 [2018-06-22 11:58:15,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:15,537 INFO ]: With dead ends: 50 [2018-06-22 11:58:15,537 INFO ]: Without dead ends: 50 [2018-06-22 11:58:15,537 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=318, Invalid=1014, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:58:15,537 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:58:15,540 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 40. [2018-06-22 11:58:15,540 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:58:15,540 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2018-06-22 11:58:15,540 INFO ]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 45 [2018-06-22 11:58:15,541 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:15,541 INFO ]: Abstraction has 40 states and 56 transitions. [2018-06-22 11:58:15,541 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:58:15,541 INFO ]: Start isEmpty. Operand 40 states and 56 transitions. [2018-06-22 11:58:15,541 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:58:15,541 INFO ]: Found error trace [2018-06-22 11:58:15,541 INFO ]: trace histogram [10, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:15,541 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:15,542 INFO ]: Analyzing trace with hash 150819440, now seen corresponding path program 22 times [2018-06-22 11:58:15,542 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:15,542 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:15,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:15,542 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:15,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:15,549 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:15,826 INFO ]: Checked inductivity of 163 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 11:58:15,827 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:15,827 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:15,832 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:58:15,851 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:58:15,851 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:15,854 INFO ]: Computing forward predicates... [2018-06-22 11:58:16,567 INFO ]: Checked inductivity of 163 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-22 11:58:16,586 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:16,586 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2018-06-22 11:58:16,586 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:58:16,586 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:58:16,587 INFO ]: CoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:58:16,587 INFO ]: Start difference. First operand 40 states and 56 transitions. Second operand 29 states. [2018-06-22 11:58:16,883 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:16,883 INFO ]: Finished difference Result 52 states and 77 transitions. [2018-06-22 11:58:16,883 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:58:16,883 INFO ]: Start accepts. Automaton has 29 states. Word has length 45 [2018-06-22 11:58:16,883 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:16,884 INFO ]: With dead ends: 52 [2018-06-22 11:58:16,884 INFO ]: Without dead ends: 52 [2018-06-22 11:58:16,884 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=314, Invalid=1092, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:58:16,884 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:58:16,887 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-06-22 11:58:16,887 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:58:16,888 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2018-06-22 11:58:16,888 INFO ]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 45 [2018-06-22 11:58:16,888 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:16,888 INFO ]: Abstraction has 46 states and 67 transitions. [2018-06-22 11:58:16,888 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:58:16,888 INFO ]: Start isEmpty. Operand 46 states and 67 transitions. [2018-06-22 11:58:16,888 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:58:16,888 INFO ]: Found error trace [2018-06-22 11:58:16,889 INFO ]: trace histogram [11, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:16,889 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:16,889 INFO ]: Analyzing trace with hash -1071153297, now seen corresponding path program 9 times [2018-06-22 11:58:16,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:16,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:16,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:16,889 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:16,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:16,899 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:17,056 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-06-22 11:58:17,213 INFO ]: Checked inductivity of 201 backedges. 20 proven. 98 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-22 11:58:17,213 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:17,213 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:17,219 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:58:17,247 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 11:58:17,247 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:17,252 INFO ]: Computing forward predicates... [2018-06-22 11:58:17,599 INFO ]: Checked inductivity of 201 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:58:17,618 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:17,618 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-06-22 11:58:17,619 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:58:17,619 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:58:17,619 INFO ]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:58:17,619 INFO ]: Start difference. First operand 46 states and 67 transitions. Second operand 29 states. [2018-06-22 11:58:18,329 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:18,329 INFO ]: Finished difference Result 60 states and 92 transitions. [2018-06-22 11:58:18,329 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:58:18,329 INFO ]: Start accepts. Automaton has 29 states. Word has length 49 [2018-06-22 11:58:18,330 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:18,330 INFO ]: With dead ends: 60 [2018-06-22 11:58:18,330 INFO ]: Without dead ends: 60 [2018-06-22 11:58:18,330 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=230, Invalid=1330, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:58:18,330 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:58:18,333 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 48. [2018-06-22 11:58:18,333 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:58:18,334 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2018-06-22 11:58:18,334 INFO ]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 49 [2018-06-22 11:58:18,334 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:18,334 INFO ]: Abstraction has 48 states and 70 transitions. [2018-06-22 11:58:18,334 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:58:18,334 INFO ]: Start isEmpty. Operand 48 states and 70 transitions. [2018-06-22 11:58:18,335 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:58:18,335 INFO ]: Found error trace [2018-06-22 11:58:18,335 INFO ]: trace histogram [11, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:18,335 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:18,335 INFO ]: Analyzing trace with hash 375388382, now seen corresponding path program 23 times [2018-06-22 11:58:18,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:18,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:18,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:18,335 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:18,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:18,342 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:18,601 INFO ]: Checked inductivity of 194 backedges. 1 proven. 117 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-22 11:58:18,601 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:18,601 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:18,606 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:58:18,633 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-06-22 11:58:18,633 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:18,636 INFO ]: Computing forward predicates... [2018-06-22 11:58:18,799 INFO ]: Checked inductivity of 194 backedges. 37 proven. 72 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-22 11:58:18,818 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:18,818 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2018-06-22 11:58:18,818 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:58:18,818 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:58:18,818 INFO ]: CoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:58:18,818 INFO ]: Start difference. First operand 48 states and 70 transitions. Second operand 29 states. [2018-06-22 11:58:19,079 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:19,079 INFO ]: Finished difference Result 48 states and 68 transitions. [2018-06-22 11:58:19,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:58:19,080 INFO ]: Start accepts. Automaton has 29 states. Word has length 49 [2018-06-22 11:58:19,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:19,080 INFO ]: With dead ends: 48 [2018-06-22 11:58:19,080 INFO ]: Without dead ends: 46 [2018-06-22 11:58:19,080 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:58:19,080 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:58:19,083 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-06-22 11:58:19,083 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:58:19,083 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2018-06-22 11:58:19,083 INFO ]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 49 [2018-06-22 11:58:19,084 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:19,084 INFO ]: Abstraction has 42 states and 58 transitions. [2018-06-22 11:58:19,084 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:58:19,084 INFO ]: Start isEmpty. Operand 42 states and 58 transitions. [2018-06-22 11:58:19,084 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:58:19,084 INFO ]: Found error trace [2018-06-22 11:58:19,084 INFO ]: trace histogram [11, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:19,084 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:19,085 INFO ]: Analyzing trace with hash -400128748, now seen corresponding path program 24 times [2018-06-22 11:58:19,085 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:19,085 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:19,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:19,086 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:19,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:19,096 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:19,359 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:58:19,509 INFO ]: Checked inductivity of 201 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-22 11:58:19,509 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:19,509 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:19,516 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:58:19,542 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-22 11:58:19,542 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:19,545 INFO ]: Computing forward predicates... [2018-06-22 11:58:19,801 INFO ]: Checked inductivity of 201 backedges. 18 proven. 110 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-22 11:58:19,821 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:19,821 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2018-06-22 11:58:19,821 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:58:19,821 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:58:19,821 INFO ]: CoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:58:19,821 INFO ]: Start difference. First operand 42 states and 58 transitions. Second operand 30 states. [2018-06-22 11:58:20,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:20,188 INFO ]: Finished difference Result 54 states and 79 transitions. [2018-06-22 11:58:20,188 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:58:20,188 INFO ]: Start accepts. Automaton has 30 states. Word has length 49 [2018-06-22 11:58:20,188 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:20,188 INFO ]: With dead ends: 54 [2018-06-22 11:58:20,188 INFO ]: Without dead ends: 54 [2018-06-22 11:58:20,189 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=370, Invalid=1190, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:58:20,189 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:58:20,191 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-06-22 11:58:20,191 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:58:20,192 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2018-06-22 11:58:20,192 INFO ]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 49 [2018-06-22 11:58:20,192 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:20,192 INFO ]: Abstraction has 48 states and 69 transitions. [2018-06-22 11:58:20,192 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:58:20,192 INFO ]: Start isEmpty. Operand 48 states and 69 transitions. [2018-06-22 11:58:20,193 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:58:20,193 INFO ]: Found error trace [2018-06-22 11:58:20,193 INFO ]: trace histogram [12, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:20,193 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:20,193 INFO ]: Analyzing trace with hash -1677657197, now seen corresponding path program 10 times [2018-06-22 11:58:20,193 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:20,193 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:20,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:20,194 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:20,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:20,202 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:20,488 INFO ]: Checked inductivity of 243 backedges. 22 proven. 119 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-06-22 11:58:20,488 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:20,488 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:20,493 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:58:20,515 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:58:20,515 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:20,518 INFO ]: Computing forward predicates... [2018-06-22 11:58:20,790 INFO ]: Checked inductivity of 243 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-06-22 11:58:20,809 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:20,809 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2018-06-22 11:58:20,809 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:58:20,809 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:58:20,809 INFO ]: CoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:58:20,810 INFO ]: Start difference. First operand 48 states and 69 transitions. Second operand 29 states. [2018-06-22 11:58:21,302 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:21,303 INFO ]: Finished difference Result 56 states and 82 transitions. [2018-06-22 11:58:21,303 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:58:21,303 INFO ]: Start accepts. Automaton has 29 states. Word has length 53 [2018-06-22 11:58:21,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:21,303 INFO ]: With dead ends: 56 [2018-06-22 11:58:21,303 INFO ]: Without dead ends: 56 [2018-06-22 11:58:21,304 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:58:21,304 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:58:21,306 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-06-22 11:58:21,307 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:58:21,308 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2018-06-22 11:58:21,309 INFO ]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 53 [2018-06-22 11:58:21,309 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:21,309 INFO ]: Abstraction has 50 states and 72 transitions. [2018-06-22 11:58:21,309 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:58:21,309 INFO ]: Start isEmpty. Operand 50 states and 72 transitions. [2018-06-22 11:58:21,310 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:58:21,310 INFO ]: Found error trace [2018-06-22 11:58:21,310 INFO ]: trace histogram [12, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:21,310 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:21,310 INFO ]: Analyzing trace with hash -516696136, now seen corresponding path program 25 times [2018-06-22 11:58:21,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:21,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:21,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:21,310 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:21,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:21,318 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:21,534 INFO ]: Checked inductivity of 243 backedges. 22 proven. 119 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-06-22 11:58:21,534 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:21,534 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:21,540 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:21,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:21,565 INFO ]: Computing forward predicates... [2018-06-22 11:58:21,807 INFO ]: Checked inductivity of 243 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-06-22 11:58:21,825 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:21,825 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2018-06-22 11:58:21,825 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:58:21,826 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:58:21,826 INFO ]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:58:21,826 INFO ]: Start difference. First operand 50 states and 72 transitions. Second operand 29 states. [2018-06-22 11:58:22,176 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:22,176 INFO ]: Finished difference Result 56 states and 78 transitions. [2018-06-22 11:58:22,176 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:58:22,176 INFO ]: Start accepts. Automaton has 29 states. Word has length 53 [2018-06-22 11:58:22,176 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:22,176 INFO ]: With dead ends: 56 [2018-06-22 11:58:22,176 INFO ]: Without dead ends: 52 [2018-06-22 11:58:22,177 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 38 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=304, Invalid=1336, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:58:22,177 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:58:22,179 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-06-22 11:58:22,179 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:58:22,180 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2018-06-22 11:58:22,180 INFO ]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 53 [2018-06-22 11:58:22,180 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:22,180 INFO ]: Abstraction has 44 states and 59 transitions. [2018-06-22 11:58:22,180 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:58:22,180 INFO ]: Start isEmpty. Operand 44 states and 59 transitions. [2018-06-22 11:58:22,181 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:58:22,181 INFO ]: Found error trace [2018-06-22 11:58:22,181 INFO ]: trace histogram [13, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:22,181 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:22,181 INFO ]: Analyzing trace with hash -1405003849, now seen corresponding path program 11 times [2018-06-22 11:58:22,181 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:22,181 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:22,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:22,182 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:22,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:22,191 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:22,412 INFO ]: Checked inductivity of 289 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-06-22 11:58:22,412 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:22,412 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 11:58:22,412 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:58:22,412 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:58:22,412 INFO ]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:58:22,412 INFO ]: Start difference. First operand 44 states and 59 transitions. Second operand 16 states. [2018-06-22 11:58:22,529 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:22,529 INFO ]: Finished difference Result 42 states and 49 transitions. [2018-06-22 11:58:22,530 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:58:22,530 INFO ]: Start accepts. Automaton has 16 states. Word has length 57 [2018-06-22 11:58:22,530 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:22,530 INFO ]: With dead ends: 42 [2018-06-22 11:58:22,530 INFO ]: Without dead ends: 40 [2018-06-22 11:58:22,530 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=302, Invalid=510, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:58:22,530 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:58:22,532 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-06-22 11:58:22,532 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:58:22,533 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-06-22 11:58:22,533 INFO ]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 57 [2018-06-22 11:58:22,533 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:22,533 INFO ]: Abstraction has 38 states and 42 transitions. [2018-06-22 11:58:22,533 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:58:22,533 INFO ]: Start isEmpty. Operand 38 states and 42 transitions. [2018-06-22 11:58:22,533 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:58:22,533 INFO ]: Found error trace [2018-06-22 11:58:22,533 INFO ]: trace histogram [13, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:22,533 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:22,534 INFO ]: Analyzing trace with hash 198756956, now seen corresponding path program 26 times [2018-06-22 11:58:22,534 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:22,534 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:22,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:22,536 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:22,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:22,550 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:22,949 WARN ]: Spent 194.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 11:58:23,281 INFO ]: Checked inductivity of 289 backedges. 134 proven. 32 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-06-22 11:58:23,281 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:23,281 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:23,287 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:58:23,316 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:58:23,316 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:23,318 INFO ]: Computing forward predicates... [2018-06-22 11:58:23,343 INFO ]: Checked inductivity of 289 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-06-22 11:58:23,361 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:58:23,361 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 19 [2018-06-22 11:58:23,361 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:58:23,361 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:58:23,361 INFO ]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:58:23,361 INFO ]: Start difference. First operand 38 states and 42 transitions. Second operand 19 states. [2018-06-22 11:58:23,485 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:23,485 INFO ]: Finished difference Result 34 states and 36 transitions. [2018-06-22 11:58:23,485 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:58:23,485 INFO ]: Start accepts. Automaton has 19 states. Word has length 57 [2018-06-22 11:58:23,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:23,485 INFO ]: With dead ends: 34 [2018-06-22 11:58:23,485 INFO ]: Without dead ends: 0 [2018-06-22 11:58:23,485 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=611, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:58:23,486 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:58:23,486 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:58:23,486 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:58:23,486 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:58:23,486 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-06-22 11:58:23,486 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:23,486 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:58:23,486 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:58:23,486 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:58:23,486 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:58:23,571 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:58:23 BoogieIcfgContainer [2018-06-22 11:58:23,571 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:58:23,572 INFO ]: Toolchain (without parser) took 46607.03 ms. Allocated memory was 303.6 MB in the beginning and 693.1 MB in the end (delta: 389.5 MB). Free memory was 260.1 MB in the beginning and 669.0 MB in the end (delta: -408.9 MB). Peak memory consumption was 10.7 MB. Max. memory is 3.6 GB. [2018-06-22 11:58:23,573 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.6 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:58:23,573 INFO ]: ChcToBoogie took 51.11 ms. Allocated memory is still 303.6 MB. Free memory was 260.1 MB in the beginning and 258.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:58:23,573 INFO ]: Boogie Preprocessor took 33.40 ms. Allocated memory is still 303.6 MB. Free memory was 258.1 MB in the beginning and 256.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:58:23,573 INFO ]: RCFGBuilder took 265.33 ms. Allocated memory is still 303.6 MB. Free memory was 256.1 MB in the beginning and 250.1 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:58:23,574 INFO ]: TraceAbstraction took 46247.53 ms. Allocated memory was 303.6 MB in the beginning and 693.1 MB in the end (delta: 389.5 MB). Free memory was 250.1 MB in the beginning and 671.6 MB in the end (delta: -421.5 MB). Peak memory consumption was 722.0 kB. Max. memory is 3.6 GB. [2018-06-22 11:58:23,578 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 303.6 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 51.11 ms. Allocated memory is still 303.6 MB. Free memory was 260.1 MB in the beginning and 258.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 33.40 ms. Allocated memory is still 303.6 MB. Free memory was 258.1 MB in the beginning and 256.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 265.33 ms. Allocated memory is still 303.6 MB. Free memory was 256.1 MB in the beginning and 250.1 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 46247.53 ms. Allocated memory was 303.6 MB in the beginning and 693.1 MB in the end (delta: 389.5 MB). Free memory was 250.1 MB in the beginning and 671.6 MB in the end (delta: -421.5 MB). Peak memory consumption was 722.0 kB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 15 locations, 1 error locations. SAFE Result, 46.1s OverallTime, 42 OverallIterations, 13 TraceHistogramMax, 19.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 819 SDtfs, 704 SDslu, 5820 SDs, 0 SdLazy, 11490 SolverSat, 1467 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2245 GetRequests, 1088 SyntacticMatches, 39 SemanticMatches, 1118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6138 ImplicationChecksByTransitivity, 30.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 42 MinimizatonAttempts, 764 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 2666 NumberOfCodeBlocks, 2640 NumberOfCodeBlocksAsserted, 183 NumberOfCheckSat, 2584 ConstructedInterpolants, 0 QuantifiedInterpolants, 680312 SizeOfPredicates, 517 NumberOfNonLiveVariables, 5597 ConjunctsInSsa, 2392 ConjunctsInUnsatCore, 82 InterpolantComputations, 5 PerfectInterpolantSequences, 3807/7163 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/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break_single.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-58-23-586.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break_single.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-58-23-586.csv Received shutdown request...