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.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:58:16,628 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:58:16,631 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:58:16,644 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:58:16,644 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:58:16,645 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:58:16,646 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:58:16,653 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:58:16,655 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:58:16,656 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:58:16,657 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:58:16,659 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:58:16,659 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:58:16,660 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:58:16,661 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:58:16,663 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:58:16,665 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:58:16,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:58:16,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:58:16,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:58:16,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:58:16,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:58:16,673 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:58:16,673 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:58:16,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:58:16,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:58:16,675 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:58:16,676 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:58:16,677 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:58:16,677 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:58:16,678 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:58:16,678 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:58:16,679 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:58:16,679 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:58:16,686 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:58:16,686 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:58:16,704 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:58:16,704 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:58:16,705 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:58:16,705 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:58:16,707 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:58:16,707 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:58:16,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:58:16,708 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:58:16,708 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:58:16,708 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:58:16,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:58:16,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:58:16,709 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:58:16,709 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:58:16,709 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:58:16,709 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:58:16,709 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:58:16,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:58:16,710 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:58:16,712 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:58:16,712 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:58:16,767 INFO ]: Repository-Root is: /tmp [2018-06-22 11:58:16,784 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:58:16,789 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:58:16,790 INFO ]: Initializing SmtParser... [2018-06-22 11:58:16,790 INFO ]: SmtParser initialized [2018-06-22 11:58:16,791 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__break.smt2 [2018-06-22 11:58:16,792 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:58:16,884 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__break.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@102b3ddb [2018-06-22 11:58:17,059 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__break.smt2 [2018-06-22 11:58:17,069 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:58:17,075 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:58:17,075 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:58:17,075 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:58:17,075 INFO ]: ChcToBoogie initialized [2018-06-22 11:58:17,078 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:58:17" (1/1) ... [2018-06-22 11:58:17,119 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:17 Unit [2018-06-22 11:58:17,119 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:58:17,121 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:58:17,121 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:58:17,121 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:58:17,143 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:17" (1/1) ... [2018-06-22 11:58:17,143 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:17" (1/1) ... [2018-06-22 11:58:17,150 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:17" (1/1) ... [2018-06-22 11:58:17,150 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:17" (1/1) ... [2018-06-22 11:58:17,153 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:17" (1/1) ... [2018-06-22 11:58:17,156 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:17" (1/1) ... [2018-06-22 11:58:17,157 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:17" (1/1) ... [2018-06-22 11:58:17,158 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:58:17,162 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:58:17,162 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:58:17,162 INFO ]: RCFGBuilder initialized [2018-06-22 11:58:17,164 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:17" (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:58:17,179 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:58:17,179 INFO ]: Found specification of procedure False [2018-06-22 11:58:17,179 INFO ]: Found implementation of procedure False [2018-06-22 11:58:17,179 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:58:17,180 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:58:17,180 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:58:17,180 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:58:17,180 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:58:17,180 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:58:17,474 INFO ]: Using library mode [2018-06-22 11:58:17,474 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:58:17 BoogieIcfgContainer [2018-06-22 11:58:17,475 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:58:17,476 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:58:17,476 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:58:17,479 INFO ]: TraceAbstraction initialized [2018-06-22 11:58:17,479 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:58:17" (1/3) ... [2018-06-22 11:58:17,480 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddde4de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:58:17, skipping insertion in model container [2018-06-22 11:58:17,480 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:58:17" (2/3) ... [2018-06-22 11:58:17,480 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddde4de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:58:17, skipping insertion in model container [2018-06-22 11:58:17,480 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:58:17" (3/3) ... [2018-06-22 11:58:17,482 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:58:17,491 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:58:17,501 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:58:17,537 INFO ]: Using default assertion order modulation [2018-06-22 11:58:17,537 INFO ]: Interprodecural is true [2018-06-22 11:58:17,537 INFO ]: Hoare is false [2018-06-22 11:58:17,537 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:58:17,537 INFO ]: Backedges is TWOTRACK [2018-06-22 11:58:17,537 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:58:17,537 INFO ]: Difference is false [2018-06-22 11:58:17,538 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:58:17,538 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:58:17,549 INFO ]: Start isEmpty. Operand 18 states. [2018-06-22 11:58:17,560 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:58:17,560 INFO ]: Found error trace [2018-06-22 11:58:17,561 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:58:17,561 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:17,564 INFO ]: Analyzing trace with hash 78563425, now seen corresponding path program 1 times [2018-06-22 11:58:17,566 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:17,567 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:17,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:17,602 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:17,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:17,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:17,637 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:58:17,638 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:17,638 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:58:17,640 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:58:17,650 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:58:17,650 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:58:17,652 INFO ]: Start difference. First operand 18 states. Second operand 2 states. [2018-06-22 11:58:17,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:17,671 INFO ]: Finished difference Result 16 states and 27 transitions. [2018-06-22 11:58:17,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:58:17,672 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:58:17,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:17,684 INFO ]: With dead ends: 16 [2018-06-22 11:58:17,684 INFO ]: Without dead ends: 16 [2018-06-22 11:58:17,686 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:58:17,705 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 11:58:17,727 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 11:58:17,728 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 11:58:17,729 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-06-22 11:58:17,730 INFO ]: Start accepts. Automaton has 16 states and 27 transitions. Word has length 5 [2018-06-22 11:58:17,731 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:17,731 INFO ]: Abstraction has 16 states and 27 transitions. [2018-06-22 11:58:17,731 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:58:17,731 INFO ]: Start isEmpty. Operand 16 states and 27 transitions. [2018-06-22 11:58:17,733 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:58:17,733 INFO ]: Found error trace [2018-06-22 11:58:17,733 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:17,733 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:17,734 INFO ]: Analyzing trace with hash 2075650895, now seen corresponding path program 1 times [2018-06-22 11:58:17,734 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:17,734 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:17,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:17,734 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:17,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:17,755 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:17,840 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:58:17,841 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:17,841 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:58:17,842 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:17,842 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:17,842 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:17,842 INFO ]: Start difference. First operand 16 states and 27 transitions. Second operand 4 states. [2018-06-22 11:58:18,000 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:18,000 INFO ]: Finished difference Result 20 states and 35 transitions. [2018-06-22 11:58:18,001 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:58:18,001 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:58:18,001 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:18,002 INFO ]: With dead ends: 20 [2018-06-22 11:58:18,002 INFO ]: Without dead ends: 20 [2018-06-22 11:58:18,003 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:18,003 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:58:18,015 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:58:18,015 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:58:18,016 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-06-22 11:58:18,016 INFO ]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 9 [2018-06-22 11:58:18,016 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:18,016 INFO ]: Abstraction has 18 states and 33 transitions. [2018-06-22 11:58:18,017 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:18,017 INFO ]: Start isEmpty. Operand 18 states and 33 transitions. [2018-06-22 11:58:18,018 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:58:18,018 INFO ]: Found error trace [2018-06-22 11:58:18,018 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:18,018 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:18,018 INFO ]: Analyzing trace with hash -881113924, now seen corresponding path program 1 times [2018-06-22 11:58:18,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:18,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:18,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:18,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:18,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:18,024 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:18,051 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:58:18,052 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:18,052 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:58:18,052 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:18,052 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:18,052 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:18,052 INFO ]: Start difference. First operand 18 states and 33 transitions. Second operand 4 states. [2018-06-22 11:58:18,216 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:18,216 INFO ]: Finished difference Result 24 states and 46 transitions. [2018-06-22 11:58:18,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:58:18,217 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:58:18,217 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:18,218 INFO ]: With dead ends: 24 [2018-06-22 11:58:18,218 INFO ]: Without dead ends: 24 [2018-06-22 11:58:18,219 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:18,219 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:58:18,228 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-06-22 11:58:18,228 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:58:18,229 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 44 transitions. [2018-06-22 11:58:18,229 INFO ]: Start accepts. Automaton has 22 states and 44 transitions. Word has length 9 [2018-06-22 11:58:18,230 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:18,230 INFO ]: Abstraction has 22 states and 44 transitions. [2018-06-22 11:58:18,230 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:18,230 INFO ]: Start isEmpty. Operand 22 states and 44 transitions. [2018-06-22 11:58:18,231 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:58:18,231 INFO ]: Found error trace [2018-06-22 11:58:18,231 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:18,231 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:18,231 INFO ]: Analyzing trace with hash 1579051653, now seen corresponding path program 1 times [2018-06-22 11:58:18,231 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:18,231 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:18,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:18,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:18,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:18,247 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:18,461 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:58:18,461 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:58:18,461 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:58:18,461 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:58:18,461 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:58:18,462 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:58:18,462 INFO ]: Start difference. First operand 22 states and 44 transitions. Second operand 4 states. [2018-06-22 11:58:18,511 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:18,511 INFO ]: Finished difference Result 24 states and 45 transitions. [2018-06-22 11:58:18,512 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:58:18,512 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:58:18,512 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:18,513 INFO ]: With dead ends: 24 [2018-06-22 11:58:18,513 INFO ]: Without dead ends: 24 [2018-06-22 11:58:18,514 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:58:18,514 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:58:18,519 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-06-22 11:58:18,519 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:58:18,520 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 43 transitions. [2018-06-22 11:58:18,520 INFO ]: Start accepts. Automaton has 22 states and 43 transitions. Word has length 9 [2018-06-22 11:58:18,520 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:18,520 INFO ]: Abstraction has 22 states and 43 transitions. [2018-06-22 11:58:18,521 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:58:18,521 INFO ]: Start isEmpty. Operand 22 states and 43 transitions. [2018-06-22 11:58:18,522 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:58:18,522 INFO ]: Found error trace [2018-06-22 11:58:18,522 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:18,522 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:18,522 INFO ]: Analyzing trace with hash -1297429910, now seen corresponding path program 1 times [2018-06-22 11:58:18,522 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:18,522 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:18,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:18,523 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:18,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:18,532 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:18,637 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:58:18,637 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:18,637 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:58:18,656 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:58:18,691 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:18,699 INFO ]: Computing forward predicates... [2018-06-22 11:58:18,748 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:58:18,767 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:18,767 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:58:18,767 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:58:18,768 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:58:18,768 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:58:18,768 INFO ]: Start difference. First operand 22 states and 43 transitions. Second operand 6 states. [2018-06-22 11:58:18,976 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:18,977 INFO ]: Finished difference Result 32 states and 70 transitions. [2018-06-22 11:58:18,977 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:58:18,977 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:58:18,977 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:18,978 INFO ]: With dead ends: 32 [2018-06-22 11:58:18,978 INFO ]: Without dead ends: 32 [2018-06-22 11:58:18,979 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:58:18,979 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:58:18,989 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-06-22 11:58:18,989 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:58:18,990 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2018-06-22 11:58:18,991 INFO ]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 13 [2018-06-22 11:58:18,991 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:18,991 INFO ]: Abstraction has 26 states and 54 transitions. [2018-06-22 11:58:18,991 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:58:18,991 INFO ]: Start isEmpty. Operand 26 states and 54 transitions. [2018-06-22 11:58:18,992 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:58:18,993 INFO ]: Found error trace [2018-06-22 11:58:18,993 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:18,993 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:18,993 INFO ]: Analyzing trace with hash -520122189, now seen corresponding path program 1 times [2018-06-22 11:58:18,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:18,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:18,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:18,994 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:18,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:19,001 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:19,288 WARN ]: Spent 189.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-06-22 11:58:19,534 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:58:19,534 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:19,534 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:58:19,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:19,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:19,560 INFO ]: Computing forward predicates... [2018-06-22 11:58:19,704 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:58:19,723 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:58:19,723 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-06-22 11:58:19,723 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:58:19,723 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:58:19,723 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:58:19,724 INFO ]: Start difference. First operand 26 states and 54 transitions. Second operand 10 states. [2018-06-22 11:58:20,023 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:20,023 INFO ]: Finished difference Result 32 states and 68 transitions. [2018-06-22 11:58:20,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:58:20,024 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:58:20,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:20,025 INFO ]: With dead ends: 32 [2018-06-22 11:58:20,025 INFO ]: Without dead ends: 32 [2018-06-22 11:58:20,025 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:58:20,025 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:58:20,033 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-06-22 11:58:20,033 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:58:20,034 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 52 transitions. [2018-06-22 11:58:20,034 INFO ]: Start accepts. Automaton has 26 states and 52 transitions. Word has length 13 [2018-06-22 11:58:20,034 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:20,035 INFO ]: Abstraction has 26 states and 52 transitions. [2018-06-22 11:58:20,035 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:58:20,035 INFO ]: Start isEmpty. Operand 26 states and 52 transitions. [2018-06-22 11:58:20,036 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:58:20,036 INFO ]: Found error trace [2018-06-22 11:58:20,036 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:20,036 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:20,036 INFO ]: Analyzing trace with hash -765373042, now seen corresponding path program 1 times [2018-06-22 11:58:20,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:20,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:20,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:20,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:20,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:20,043 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:20,140 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:58:20,140 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:20,140 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:58:20,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:20,158 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:20,160 INFO ]: Computing forward predicates... [2018-06-22 11:58:20,248 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:58:20,268 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:58:20,268 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-06-22 11:58:20,269 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:58:20,269 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:58:20,269 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:58:20,269 INFO ]: Start difference. First operand 26 states and 52 transitions. Second operand 10 states. [2018-06-22 11:58:20,574 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:20,574 INFO ]: Finished difference Result 32 states and 67 transitions. [2018-06-22 11:58:20,581 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:58:20,581 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:58:20,581 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:20,582 INFO ]: With dead ends: 32 [2018-06-22 11:58:20,582 INFO ]: Without dead ends: 32 [2018-06-22 11:58:20,582 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:58:20,582 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:58:20,590 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-06-22 11:58:20,590 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:58:20,591 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 51 transitions. [2018-06-22 11:58:20,591 INFO ]: Start accepts. Automaton has 26 states and 51 transitions. Word has length 13 [2018-06-22 11:58:20,591 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:20,591 INFO ]: Abstraction has 26 states and 51 transitions. [2018-06-22 11:58:20,591 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:58:20,591 INFO ]: Start isEmpty. Operand 26 states and 51 transitions. [2018-06-22 11:58:20,592 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:58:20,592 INFO ]: Found error trace [2018-06-22 11:58:20,592 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:20,593 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:20,593 INFO ]: Analyzing trace with hash 836518744, now seen corresponding path program 1 times [2018-06-22 11:58:20,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:20,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:20,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:20,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:20,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:20,599 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:20,639 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:58:20,639 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:20,639 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:58:20,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:20,652 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:20,654 INFO ]: Computing forward predicates... [2018-06-22 11:58:20,667 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:58:20,686 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:20,686 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:58:20,686 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:58:20,686 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:58:20,686 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:58:20,687 INFO ]: Start difference. First operand 26 states and 51 transitions. Second operand 6 states. [2018-06-22 11:58:20,777 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:20,777 INFO ]: Finished difference Result 42 states and 93 transitions. [2018-06-22 11:58:20,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:58:20,778 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:58:20,778 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:20,779 INFO ]: With dead ends: 42 [2018-06-22 11:58:20,779 INFO ]: Without dead ends: 42 [2018-06-22 11:58:20,780 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:58:20,780 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:58:20,789 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-06-22 11:58:20,789 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:58:20,790 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2018-06-22 11:58:20,790 INFO ]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 13 [2018-06-22 11:58:20,790 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:20,790 INFO ]: Abstraction has 32 states and 66 transitions. [2018-06-22 11:58:20,790 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:58:20,790 INFO ]: Start isEmpty. Operand 32 states and 66 transitions. [2018-06-22 11:58:20,792 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:58:20,792 INFO ]: Found error trace [2018-06-22 11:58:20,792 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:20,792 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:20,792 INFO ]: Analyzing trace with hash -1010623895, now seen corresponding path program 1 times [2018-06-22 11:58:20,792 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:20,792 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:20,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:20,793 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:20,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:20,813 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:20,990 WARN ]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 11:58:21,028 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:58:21,028 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:21,028 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) [2018-06-22 11:58:21,043 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:21,055 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:21,057 INFO ]: Computing forward predicates... [2018-06-22 11:58:21,216 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:58:21,239 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:21,239 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:58:21,239 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:58:21,239 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:58:21,239 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:58:21,239 INFO ]: Start difference. First operand 32 states and 66 transitions. Second operand 10 states. [2018-06-22 11:58:21,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:21,528 INFO ]: Finished difference Result 48 states and 102 transitions. [2018-06-22 11:58:21,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:58:21,529 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:58:21,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:21,530 INFO ]: With dead ends: 48 [2018-06-22 11:58:21,530 INFO ]: Without dead ends: 47 [2018-06-22 11:58:21,531 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:58:21,531 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:58:21,540 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 31. [2018-06-22 11:58:21,540 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:58:21,541 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2018-06-22 11:58:21,541 INFO ]: Start accepts. Automaton has 31 states and 60 transitions. Word has length 13 [2018-06-22 11:58:21,541 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:21,541 INFO ]: Abstraction has 31 states and 60 transitions. [2018-06-22 11:58:21,541 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:58:21,541 INFO ]: Start isEmpty. Operand 31 states and 60 transitions. [2018-06-22 11:58:21,543 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:58:21,543 INFO ]: Found error trace [2018-06-22 11:58:21,543 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:21,543 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:21,543 INFO ]: Analyzing trace with hash -1787931616, now seen corresponding path program 1 times [2018-06-22 11:58:21,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:21,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:21,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:21,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:21,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:21,549 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:21,583 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:58:21,583 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:21,583 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:58:21,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:21,596 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:21,609 INFO ]: Computing forward predicates... [2018-06-22 11:58:21,630 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:58:21,662 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:21,662 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:58:21,662 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:58:21,662 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:58:21,662 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:58:21,662 INFO ]: Start difference. First operand 31 states and 60 transitions. Second operand 6 states. [2018-06-22 11:58:21,932 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:21,933 INFO ]: Finished difference Result 43 states and 88 transitions. [2018-06-22 11:58:21,933 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:58:21,933 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:58:21,933 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:21,933 INFO ]: With dead ends: 43 [2018-06-22 11:58:21,933 INFO ]: Without dead ends: 43 [2018-06-22 11:58:21,934 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:58:21,934 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:58:21,945 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 31. [2018-06-22 11:58:21,945 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:58:21,946 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2018-06-22 11:58:21,946 INFO ]: Start accepts. Automaton has 31 states and 60 transitions. Word has length 13 [2018-06-22 11:58:21,946 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:21,946 INFO ]: Abstraction has 31 states and 60 transitions. [2018-06-22 11:58:21,946 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:58:21,946 INFO ]: Start isEmpty. Operand 31 states and 60 transitions. [2018-06-22 11:58:21,947 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:21,947 INFO ]: Found error trace [2018-06-22 11:58:21,947 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:21,947 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:21,947 INFO ]: Analyzing trace with hash 587747224, now seen corresponding path program 2 times [2018-06-22 11:58:21,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:21,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:21,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:21,950 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:21,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:21,965 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:22,012 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:58:22,012 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:22,012 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) [2018-06-22 11:58:22,030 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:22,059 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:58:22,059 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:22,061 INFO ]: Computing forward predicates... [2018-06-22 11:58:22,071 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:58:22,090 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:22,090 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:58:22,091 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:58:22,091 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:58:22,091 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:58:22,091 INFO ]: Start difference. First operand 31 states and 60 transitions. Second operand 7 states. [2018-06-22 11:58:22,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:22,236 INFO ]: Finished difference Result 55 states and 114 transitions. [2018-06-22 11:58:22,236 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:58:22,236 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:58:22,236 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:22,237 INFO ]: With dead ends: 55 [2018-06-22 11:58:22,237 INFO ]: Without dead ends: 55 [2018-06-22 11:58:22,237 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:58:22,238 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:58:22,245 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 37. [2018-06-22 11:58:22,245 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:58:22,246 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 73 transitions. [2018-06-22 11:58:22,246 INFO ]: Start accepts. Automaton has 37 states and 73 transitions. Word has length 17 [2018-06-22 11:58:22,246 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:22,246 INFO ]: Abstraction has 37 states and 73 transitions. [2018-06-22 11:58:22,246 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:58:22,246 INFO ]: Start isEmpty. Operand 37 states and 73 transitions. [2018-06-22 11:58:22,247 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:22,247 INFO ]: Found error trace [2018-06-22 11:58:22,247 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:22,248 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:22,248 INFO ]: Analyzing trace with hash -1231967154, now seen corresponding path program 1 times [2018-06-22 11:58:22,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:22,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:22,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:22,248 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:22,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:22,255 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:22,298 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:58:22,299 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:22,299 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:58:22,304 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:22,314 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:22,316 INFO ]: Computing forward predicates... [2018-06-22 11:58:22,326 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:58:22,345 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:22,345 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:58:22,346 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:58:22,346 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:58:22,346 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:58:22,346 INFO ]: Start difference. First operand 37 states and 73 transitions. Second operand 8 states. [2018-06-22 11:58:22,483 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:22,483 INFO ]: Finished difference Result 71 states and 154 transitions. [2018-06-22 11:58:22,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:58:22,484 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:58:22,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:22,486 INFO ]: With dead ends: 71 [2018-06-22 11:58:22,486 INFO ]: Without dead ends: 71 [2018-06-22 11:58:22,486 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:58:22,486 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:58:22,497 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 37. [2018-06-22 11:58:22,497 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:58:22,498 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 73 transitions. [2018-06-22 11:58:22,498 INFO ]: Start accepts. Automaton has 37 states and 73 transitions. Word has length 17 [2018-06-22 11:58:22,498 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:22,498 INFO ]: Abstraction has 37 states and 73 transitions. [2018-06-22 11:58:22,498 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:58:22,498 INFO ]: Start isEmpty. Operand 37 states and 73 transitions. [2018-06-22 11:58:22,499 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:58:22,499 INFO ]: Found error trace [2018-06-22 11:58:22,499 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:22,500 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:22,500 INFO ]: Analyzing trace with hash -1259275871, now seen corresponding path program 2 times [2018-06-22 11:58:22,500 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:22,500 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:22,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:22,500 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:22,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:22,507 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:22,608 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:58:22,608 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:22,608 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:58:22,614 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:58:22,621 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:58:22,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:22,623 INFO ]: Computing forward predicates... [2018-06-22 11:58:22,633 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:58:22,652 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:22,652 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:58:22,652 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:58:22,652 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:58:22,652 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:58:22,653 INFO ]: Start difference. First operand 37 states and 73 transitions. Second operand 7 states. [2018-06-22 11:58:22,759 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:22,759 INFO ]: Finished difference Result 65 states and 135 transitions. [2018-06-22 11:58:22,760 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:58:22,760 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:58:22,760 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:22,761 INFO ]: With dead ends: 65 [2018-06-22 11:58:22,761 INFO ]: Without dead ends: 65 [2018-06-22 11:58:22,761 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:58:22,761 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:58:22,769 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 45. [2018-06-22 11:58:22,769 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:58:22,770 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 90 transitions. [2018-06-22 11:58:22,771 INFO ]: Start accepts. Automaton has 45 states and 90 transitions. Word has length 17 [2018-06-22 11:58:22,771 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:22,771 INFO ]: Abstraction has 45 states and 90 transitions. [2018-06-22 11:58:22,771 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:58:22,771 INFO ]: Start isEmpty. Operand 45 states and 90 transitions. [2018-06-22 11:58:22,772 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:58:22,772 INFO ]: Found error trace [2018-06-22 11:58:22,772 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:22,772 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:22,772 INFO ]: Analyzing trace with hash 662729798, now seen corresponding path program 3 times [2018-06-22 11:58:22,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:22,772 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:22,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:22,773 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:22,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:22,779 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:22,873 INFO ]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:58:22,873 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:22,873 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) [2018-06-22 11:58:22,888 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:22,937 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:58:22,937 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:22,940 INFO ]: Computing forward predicates... [2018-06-22 11:58:22,967 INFO ]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:58:22,987 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:58:22,987 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-06-22 11:58:22,987 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:58:22,987 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:58:22,987 INFO ]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:58:22,987 INFO ]: Start difference. First operand 45 states and 90 transitions. Second operand 10 states. [2018-06-22 11:58:23,142 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:23,143 INFO ]: Finished difference Result 79 states and 165 transitions. [2018-06-22 11:58:23,143 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:58:23,143 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-22 11:58:23,143 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:23,144 INFO ]: With dead ends: 79 [2018-06-22 11:58:23,144 INFO ]: Without dead ends: 79 [2018-06-22 11:58:23,144 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:58:23,144 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:58:23,154 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 51. [2018-06-22 11:58:23,154 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:58:23,155 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 102 transitions. [2018-06-22 11:58:23,155 INFO ]: Start accepts. Automaton has 51 states and 102 transitions. Word has length 21 [2018-06-22 11:58:23,155 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:23,155 INFO ]: Abstraction has 51 states and 102 transitions. [2018-06-22 11:58:23,155 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:58:23,155 INFO ]: Start isEmpty. Operand 51 states and 102 transitions. [2018-06-22 11:58:23,156 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:58:23,156 INFO ]: Found error trace [2018-06-22 11:58:23,157 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:23,157 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:23,157 INFO ]: Analyzing trace with hash 468008490, now seen corresponding path program 3 times [2018-06-22 11:58:23,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:23,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:23,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:23,157 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:23,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:23,164 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:23,231 INFO ]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:58:23,231 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:23,231 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:58:23,238 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:58:23,247 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:58:23,247 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:23,248 INFO ]: Computing forward predicates... [2018-06-22 11:58:23,271 INFO ]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:58:23,297 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:58:23,297 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-06-22 11:58:23,298 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:58:23,298 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:58:23,298 INFO ]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:58:23,298 INFO ]: Start difference. First operand 51 states and 102 transitions. Second operand 10 states. [2018-06-22 11:58:23,592 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:23,592 INFO ]: Finished difference Result 65 states and 137 transitions. [2018-06-22 11:58:23,592 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:58:23,592 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-22 11:58:23,592 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:23,593 INFO ]: With dead ends: 65 [2018-06-22 11:58:23,593 INFO ]: Without dead ends: 65 [2018-06-22 11:58:23,594 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:58:23,594 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:58:23,600 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 39. [2018-06-22 11:58:23,600 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:58:23,601 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 75 transitions. [2018-06-22 11:58:23,601 INFO ]: Start accepts. Automaton has 39 states and 75 transitions. Word has length 21 [2018-06-22 11:58:23,601 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:23,601 INFO ]: Abstraction has 39 states and 75 transitions. [2018-06-22 11:58:23,601 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:58:23,601 INFO ]: Start isEmpty. Operand 39 states and 75 transitions. [2018-06-22 11:58:23,602 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:58:23,602 INFO ]: Found error trace [2018-06-22 11:58:23,602 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:23,603 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:23,603 INFO ]: Analyzing trace with hash -2057555204, now seen corresponding path program 2 times [2018-06-22 11:58:23,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:23,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:23,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:23,603 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:23,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:23,609 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:23,694 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:58:23,694 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:23,694 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) [2018-06-22 11:58:23,710 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:58:23,732 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:58:23,732 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:23,734 INFO ]: Computing forward predicates... [2018-06-22 11:58:23,755 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:58:23,774 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:23,774 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:58:23,774 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:58:23,774 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:58:23,774 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:58:23,774 INFO ]: Start difference. First operand 39 states and 75 transitions. Second operand 9 states. [2018-06-22 11:58:24,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:24,540 INFO ]: Finished difference Result 85 states and 180 transitions. [2018-06-22 11:58:24,541 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:58:24,541 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 11:58:24,541 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:24,542 INFO ]: With dead ends: 85 [2018-06-22 11:58:24,542 INFO ]: Without dead ends: 85 [2018-06-22 11:58:24,542 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:58:24,542 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 11:58:24,548 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 47. [2018-06-22 11:58:24,548 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:58:24,549 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 92 transitions. [2018-06-22 11:58:24,549 INFO ]: Start accepts. Automaton has 47 states and 92 transitions. Word has length 21 [2018-06-22 11:58:24,550 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:24,550 INFO ]: Abstraction has 47 states and 92 transitions. [2018-06-22 11:58:24,550 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:58:24,550 INFO ]: Start isEmpty. Operand 47 states and 92 transitions. [2018-06-22 11:58:24,551 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:58:24,551 INFO ]: Found error trace [2018-06-22 11:58:24,551 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:24,551 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:24,551 INFO ]: Analyzing trace with hash 1023328682, now seen corresponding path program 3 times [2018-06-22 11:58:24,551 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:24,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:24,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:24,552 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:24,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:24,559 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:24,642 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:58:24,642 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:24,642 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:58:24,648 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:58:24,677 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:58:24,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:24,680 INFO ]: Computing forward predicates... [2018-06-22 11:58:24,763 INFO ]: Checked inductivity of 33 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:58:24,782 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:24,782 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2018-06-22 11:58:24,783 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:58:24,783 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:58:24,783 INFO ]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:58:24,783 INFO ]: Start difference. First operand 47 states and 92 transitions. Second operand 14 states. [2018-06-22 11:58:25,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:25,177 INFO ]: Finished difference Result 83 states and 175 transitions. [2018-06-22 11:58:25,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:58:25,177 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:58:25,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:25,178 INFO ]: With dead ends: 83 [2018-06-22 11:58:25,178 INFO ]: Without dead ends: 83 [2018-06-22 11:58:25,179 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:58:25,179 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 11:58:25,184 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 47. [2018-06-22 11:58:25,185 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:58:25,185 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 91 transitions. [2018-06-22 11:58:25,185 INFO ]: Start accepts. Automaton has 47 states and 91 transitions. Word has length 25 [2018-06-22 11:58:25,186 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:25,186 INFO ]: Abstraction has 47 states and 91 transitions. [2018-06-22 11:58:25,186 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:58:25,186 INFO ]: Start isEmpty. Operand 47 states and 91 transitions. [2018-06-22 11:58:25,187 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:58:25,187 INFO ]: Found error trace [2018-06-22 11:58:25,187 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:25,187 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:25,187 INFO ]: Analyzing trace with hash -1142403873, now seen corresponding path program 1 times [2018-06-22 11:58:25,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:25,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:25,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:25,188 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:25,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:25,195 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:25,254 INFO ]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:58:25,254 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:25,254 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:58:25,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:25,280 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:25,282 INFO ]: Computing forward predicates... [2018-06-22 11:58:25,352 INFO ]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:58:25,383 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:25,383 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:58:25,384 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:58:25,384 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:58:25,384 INFO ]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:58:25,384 INFO ]: Start difference. First operand 47 states and 91 transitions. Second operand 9 states. [2018-06-22 11:58:25,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:25,636 INFO ]: Finished difference Result 85 states and 174 transitions. [2018-06-22 11:58:25,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:58:25,636 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 11:58:25,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:25,637 INFO ]: With dead ends: 85 [2018-06-22 11:58:25,637 INFO ]: Without dead ends: 85 [2018-06-22 11:58:25,638 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:58:25,638 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 11:58:25,646 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 57. [2018-06-22 11:58:25,647 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:58:25,647 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 112 transitions. [2018-06-22 11:58:25,648 INFO ]: Start accepts. Automaton has 57 states and 112 transitions. Word has length 25 [2018-06-22 11:58:25,648 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:25,648 INFO ]: Abstraction has 57 states and 112 transitions. [2018-06-22 11:58:25,648 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:58:25,648 INFO ]: Start isEmpty. Operand 57 states and 112 transitions. [2018-06-22 11:58:25,650 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:58:25,650 INFO ]: Found error trace [2018-06-22 11:58:25,650 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:25,650 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:25,650 INFO ]: Analyzing trace with hash -59380777, now seen corresponding path program 1 times [2018-06-22 11:58:25,650 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:25,650 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:25,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:25,651 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:25,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:25,659 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:25,813 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:58:25,813 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:25,813 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:58:25,819 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:25,831 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:25,833 INFO ]: Computing forward predicates... [2018-06-22 11:58:25,859 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:58:25,878 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:25,879 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:58:25,879 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:58:25,879 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:58:25,879 INFO ]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:58:25,879 INFO ]: Start difference. First operand 57 states and 112 transitions. Second operand 10 states. [2018-06-22 11:58:26,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:26,033 INFO ]: Finished difference Result 103 states and 212 transitions. [2018-06-22 11:58:26,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:58:26,033 INFO ]: Start accepts. Automaton has 10 states. Word has length 29 [2018-06-22 11:58:26,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:26,034 INFO ]: With dead ends: 103 [2018-06-22 11:58:26,034 INFO ]: Without dead ends: 103 [2018-06-22 11:58:26,035 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:58:26,035 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 11:58:26,041 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 67. [2018-06-22 11:58:26,041 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 11:58:26,043 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 133 transitions. [2018-06-22 11:58:26,043 INFO ]: Start accepts. Automaton has 67 states and 133 transitions. Word has length 29 [2018-06-22 11:58:26,043 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:26,043 INFO ]: Abstraction has 67 states and 133 transitions. [2018-06-22 11:58:26,043 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:58:26,043 INFO ]: Start isEmpty. Operand 67 states and 133 transitions. [2018-06-22 11:58:26,045 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:58:26,045 INFO ]: Found error trace [2018-06-22 11:58:26,045 INFO ]: trace histogram [6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:26,051 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:26,051 INFO ]: Analyzing trace with hash 2021592078, now seen corresponding path program 4 times [2018-06-22 11:58:26,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:26,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:26,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:26,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:26,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:26,064 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:26,166 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:58:26,166 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:26,166 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:58:26,172 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:58:26,184 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:58:26,185 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:26,187 INFO ]: Computing forward predicates... [2018-06-22 11:58:26,274 INFO ]: Checked inductivity of 49 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:58:26,293 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:26,293 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-06-22 11:58:26,293 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:58:26,293 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:58:26,294 INFO ]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:58:26,294 INFO ]: Start difference. First operand 67 states and 133 transitions. Second operand 17 states. [2018-06-22 11:58:26,760 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:26,760 INFO ]: Finished difference Result 165 states and 347 transitions. [2018-06-22 11:58:26,760 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:58:26,760 INFO ]: Start accepts. Automaton has 17 states. Word has length 29 [2018-06-22 11:58:26,760 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:26,762 INFO ]: With dead ends: 165 [2018-06-22 11:58:26,762 INFO ]: Without dead ends: 165 [2018-06-22 11:58:26,763 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:58:26,763 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-22 11:58:26,778 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 79. [2018-06-22 11:58:26,778 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:58:26,780 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 157 transitions. [2018-06-22 11:58:26,780 INFO ]: Start accepts. Automaton has 79 states and 157 transitions. Word has length 29 [2018-06-22 11:58:26,780 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:26,780 INFO ]: Abstraction has 79 states and 157 transitions. [2018-06-22 11:58:26,780 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:58:26,780 INFO ]: Start isEmpty. Operand 79 states and 157 transitions. [2018-06-22 11:58:26,782 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:58:26,782 INFO ]: Found error trace [2018-06-22 11:58:26,782 INFO ]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:26,782 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:26,782 INFO ]: Analyzing trace with hash 1361375328, now seen corresponding path program 2 times [2018-06-22 11:58:26,782 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:26,782 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:26,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:26,783 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:26,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:26,796 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:27,476 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:27,476 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:27,476 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:58:27,481 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:58:27,503 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:58:27,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:27,505 INFO ]: Computing forward predicates... [2018-06-22 11:58:27,521 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:27,540 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:27,540 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:58:27,540 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:58:27,540 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:58:27,541 INFO ]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:58:27,541 INFO ]: Start difference. First operand 79 states and 157 transitions. Second operand 11 states. [2018-06-22 11:58:28,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:28,346 INFO ]: Finished difference Result 143 states and 295 transitions. [2018-06-22 11:58:28,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:58:28,346 INFO ]: Start accepts. Automaton has 11 states. Word has length 33 [2018-06-22 11:58:28,346 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:28,347 INFO ]: With dead ends: 143 [2018-06-22 11:58:28,347 INFO ]: Without dead ends: 143 [2018-06-22 11:58:28,347 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:58:28,348 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-22 11:58:28,358 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 91. [2018-06-22 11:58:28,358 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 11:58:28,359 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 182 transitions. [2018-06-22 11:58:28,359 INFO ]: Start accepts. Automaton has 91 states and 182 transitions. Word has length 33 [2018-06-22 11:58:28,359 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:28,359 INFO ]: Abstraction has 91 states and 182 transitions. [2018-06-22 11:58:28,359 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:58:28,359 INFO ]: Start isEmpty. Operand 91 states and 182 transitions. [2018-06-22 11:58:28,361 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:58:28,361 INFO ]: Found error trace [2018-06-22 11:58:28,361 INFO ]: trace histogram [7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:28,361 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:28,362 INFO ]: Analyzing trace with hash 2298738, now seen corresponding path program 5 times [2018-06-22 11:58:28,362 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:28,362 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:28,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:28,362 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:28,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:28,369 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:28,452 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:58:28,453 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:28,453 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:58:28,460 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:58:28,478 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 11:58:28,478 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:28,480 INFO ]: Computing forward predicates... [2018-06-22 11:58:28,506 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:58:28,541 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:28,541 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 11:58:28,541 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:58:28,541 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:58:28,542 INFO ]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:58:28,542 INFO ]: Start difference. First operand 91 states and 182 transitions. Second operand 12 states. [2018-06-22 11:58:29,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:29,238 INFO ]: Finished difference Result 225 states and 473 transitions. [2018-06-22 11:58:29,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:58:29,239 INFO ]: Start accepts. Automaton has 12 states. Word has length 33 [2018-06-22 11:58:29,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:29,242 INFO ]: With dead ends: 225 [2018-06-22 11:58:29,242 INFO ]: Without dead ends: 225 [2018-06-22 11:58:29,242 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:58:29,243 INFO ]: Start minimizeSevpa. Operand 225 states. [2018-06-22 11:58:29,257 INFO ]: Finished minimizeSevpa. Reduced states from 225 to 103. [2018-06-22 11:58:29,257 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 11:58:29,258 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 207 transitions. [2018-06-22 11:58:29,259 INFO ]: Start accepts. Automaton has 103 states and 207 transitions. Word has length 33 [2018-06-22 11:58:29,259 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:29,259 INFO ]: Abstraction has 103 states and 207 transitions. [2018-06-22 11:58:29,259 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:58:29,259 INFO ]: Start isEmpty. Operand 103 states and 207 transitions. [2018-06-22 11:58:29,261 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:58:29,261 INFO ]: Found error trace [2018-06-22 11:58:29,261 INFO ]: trace histogram [8, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:29,261 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:29,261 INFO ]: Analyzing trace with hash 1372582697, now seen corresponding path program 3 times [2018-06-22 11:58:29,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:29,261 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:29,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:29,262 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:29,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:29,268 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:29,377 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:29,377 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:29,377 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:58:29,383 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:58:29,400 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:58:29,400 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:29,402 INFO ]: Computing forward predicates... [2018-06-22 11:58:29,512 INFO ]: Checked inductivity of 99 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:58:29,538 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:29,538 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-06-22 11:58:29,538 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:58:29,538 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:58:29,538 INFO ]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:58:29,538 INFO ]: Start difference. First operand 103 states and 207 transitions. Second operand 16 states. [2018-06-22 11:58:29,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:29,886 INFO ]: Finished difference Result 195 states and 409 transitions. [2018-06-22 11:58:29,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:58:29,886 INFO ]: Start accepts. Automaton has 16 states. Word has length 37 [2018-06-22 11:58:29,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:29,888 INFO ]: With dead ends: 195 [2018-06-22 11:58:29,888 INFO ]: Without dead ends: 195 [2018-06-22 11:58:29,888 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:58:29,888 INFO ]: Start minimizeSevpa. Operand 195 states. [2018-06-22 11:58:29,902 INFO ]: Finished minimizeSevpa. Reduced states from 195 to 91. [2018-06-22 11:58:29,902 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 11:58:29,903 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 181 transitions. [2018-06-22 11:58:29,903 INFO ]: Start accepts. Automaton has 91 states and 181 transitions. Word has length 37 [2018-06-22 11:58:29,903 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:29,903 INFO ]: Abstraction has 91 states and 181 transitions. [2018-06-22 11:58:29,903 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:58:29,903 INFO ]: Start isEmpty. Operand 91 states and 181 transitions. [2018-06-22 11:58:29,905 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:58:29,905 INFO ]: Found error trace [2018-06-22 11:58:29,905 INFO ]: trace histogram [8, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:29,905 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:29,905 INFO ]: Analyzing trace with hash 1843885472, now seen corresponding path program 6 times [2018-06-22 11:58:29,905 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:29,905 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:29,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:29,907 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:29,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:29,916 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:30,444 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:30,444 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:30,444 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:58:30,455 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:58:30,472 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:58:30,472 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:30,474 INFO ]: Computing forward predicates... [2018-06-22 11:58:30,557 INFO ]: Checked inductivity of 93 backedges. 35 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 11:58:30,577 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:30,577 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-06-22 11:58:30,577 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:58:30,577 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:58:30,577 INFO ]: CoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:58:30,577 INFO ]: Start difference. First operand 91 states and 181 transitions. Second operand 19 states. [2018-06-22 11:58:31,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:31,323 INFO ]: Finished difference Result 231 states and 483 transitions. [2018-06-22 11:58:31,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 11:58:31,324 INFO ]: Start accepts. Automaton has 19 states. Word has length 37 [2018-06-22 11:58:31,324 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:31,326 INFO ]: With dead ends: 231 [2018-06-22 11:58:31,326 INFO ]: Without dead ends: 231 [2018-06-22 11:58:31,327 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:58:31,327 INFO ]: Start minimizeSevpa. Operand 231 states. [2018-06-22 11:58:31,347 INFO ]: Finished minimizeSevpa. Reduced states from 231 to 105. [2018-06-22 11:58:31,347 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-22 11:58:31,348 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 209 transitions. [2018-06-22 11:58:31,348 INFO ]: Start accepts. Automaton has 105 states and 209 transitions. Word has length 37 [2018-06-22 11:58:31,348 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:31,348 INFO ]: Abstraction has 105 states and 209 transitions. [2018-06-22 11:58:31,348 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:58:31,348 INFO ]: Start isEmpty. Operand 105 states and 209 transitions. [2018-06-22 11:58:31,351 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:58:31,351 INFO ]: Found error trace [2018-06-22 11:58:31,351 INFO ]: trace histogram [9, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:31,351 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:31,351 INFO ]: Analyzing trace with hash -1956568563, now seen corresponding path program 4 times [2018-06-22 11:58:31,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:31,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:31,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:31,352 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:31,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:31,379 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:31,708 INFO ]: Checked inductivity of 124 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-22 11:58:31,708 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:31,708 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:58:31,715 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:58:31,730 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:58:31,730 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:31,732 INFO ]: Computing forward predicates... [2018-06-22 11:58:31,782 INFO ]: Checked inductivity of 124 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-22 11:58:31,810 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:31,810 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 11:58:31,810 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:58:31,810 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:58:31,810 INFO ]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:58:31,811 INFO ]: Start difference. First operand 105 states and 209 transitions. Second operand 13 states. [2018-06-22 11:58:32,018 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:32,018 INFO ]: Finished difference Result 193 states and 397 transitions. [2018-06-22 11:58:32,019 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:58:32,019 INFO ]: Start accepts. Automaton has 13 states. Word has length 41 [2018-06-22 11:58:32,019 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:32,021 INFO ]: With dead ends: 193 [2018-06-22 11:58:32,021 INFO ]: Without dead ends: 193 [2018-06-22 11:58:32,022 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:58:32,022 INFO ]: Start minimizeSevpa. Operand 193 states. [2018-06-22 11:58:32,036 INFO ]: Finished minimizeSevpa. Reduced states from 193 to 119. [2018-06-22 11:58:32,036 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-22 11:58:32,038 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 238 transitions. [2018-06-22 11:58:32,038 INFO ]: Start accepts. Automaton has 119 states and 238 transitions. Word has length 41 [2018-06-22 11:58:32,038 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:32,038 INFO ]: Abstraction has 119 states and 238 transitions. [2018-06-22 11:58:32,038 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:58:32,038 INFO ]: Start isEmpty. Operand 119 states and 238 transitions. [2018-06-22 11:58:32,041 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:58:32,041 INFO ]: Found error trace [2018-06-22 11:58:32,041 INFO ]: trace histogram [9, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:32,041 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:32,041 INFO ]: Analyzing trace with hash -1537137660, now seen corresponding path program 7 times [2018-06-22 11:58:32,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:32,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:32,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:32,042 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:32,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:32,052 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:32,444 INFO ]: Checked inductivity of 120 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-22 11:58:32,444 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:32,445 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:58:32,450 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:32,470 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:32,471 INFO ]: Computing forward predicates... [2018-06-22 11:58:32,504 INFO ]: Checked inductivity of 120 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-22 11:58:32,523 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:32,523 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-22 11:58:32,523 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:58:32,523 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:58:32,524 INFO ]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:58:32,524 INFO ]: Start difference. First operand 119 states and 238 transitions. Second operand 14 states. [2018-06-22 11:58:32,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:32,866 INFO ]: Finished difference Result 303 states and 633 transitions. [2018-06-22 11:58:32,866 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:58:32,866 INFO ]: Start accepts. Automaton has 14 states. Word has length 41 [2018-06-22 11:58:32,866 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:32,868 INFO ]: With dead ends: 303 [2018-06-22 11:58:32,868 INFO ]: Without dead ends: 303 [2018-06-22 11:58:32,868 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:58:32,868 INFO ]: Start minimizeSevpa. Operand 303 states. [2018-06-22 11:58:32,888 INFO ]: Finished minimizeSevpa. Reduced states from 303 to 133. [2018-06-22 11:58:32,888 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-22 11:58:32,891 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 267 transitions. [2018-06-22 11:58:32,891 INFO ]: Start accepts. Automaton has 133 states and 267 transitions. Word has length 41 [2018-06-22 11:58:32,891 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:32,891 INFO ]: Abstraction has 133 states and 267 transitions. [2018-06-22 11:58:32,891 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:58:32,891 INFO ]: Start isEmpty. Operand 133 states and 267 transitions. [2018-06-22 11:58:32,894 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:58:32,894 INFO ]: Found error trace [2018-06-22 11:58:32,894 INFO ]: trace histogram [10, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:32,894 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:32,894 INFO ]: Analyzing trace with hash 1539679894, now seen corresponding path program 5 times [2018-06-22 11:58:32,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:32,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:32,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:32,896 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:32,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:32,908 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:33,110 INFO ]: Checked inductivity of 157 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 11:58:33,110 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:33,110 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:33,115 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:58:33,149 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 11:58:33,149 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:33,151 INFO ]: Computing forward predicates... [2018-06-22 11:58:33,175 INFO ]: Checked inductivity of 157 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 11:58:33,193 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:33,193 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-22 11:58:33,194 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:58:33,194 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:58:33,194 INFO ]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:58:33,194 INFO ]: Start difference. First operand 133 states and 267 transitions. Second operand 14 states. [2018-06-22 11:58:33,421 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:33,421 INFO ]: Finished difference Result 249 states and 513 transitions. [2018-06-22 11:58:33,421 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:58:33,421 INFO ]: Start accepts. Automaton has 14 states. Word has length 45 [2018-06-22 11:58:33,421 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:33,423 INFO ]: With dead ends: 249 [2018-06-22 11:58:33,423 INFO ]: Without dead ends: 249 [2018-06-22 11:58:33,423 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:58:33,423 INFO ]: Start minimizeSevpa. Operand 249 states. [2018-06-22 11:58:33,438 INFO ]: Finished minimizeSevpa. Reduced states from 249 to 149. [2018-06-22 11:58:33,438 INFO ]: Start removeUnreachable. Operand 149 states. [2018-06-22 11:58:33,439 INFO ]: Finished removeUnreachable. Reduced from 149 states to 149 states and 300 transitions. [2018-06-22 11:58:33,439 INFO ]: Start accepts. Automaton has 149 states and 300 transitions. Word has length 45 [2018-06-22 11:58:33,439 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:33,439 INFO ]: Abstraction has 149 states and 300 transitions. [2018-06-22 11:58:33,439 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:58:33,439 INFO ]: Start isEmpty. Operand 149 states and 300 transitions. [2018-06-22 11:58:33,442 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:58:33,442 INFO ]: Found error trace [2018-06-22 11:58:33,442 INFO ]: trace histogram [10, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:33,442 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:33,442 INFO ]: Analyzing trace with hash -1083076686, now seen corresponding path program 8 times [2018-06-22 11:58:33,442 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:33,442 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:33,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:33,442 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:33,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:33,451 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:34,325 INFO ]: Checked inductivity of 151 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 11:58:34,325 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:34,325 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:34,330 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:58:34,348 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:58:34,348 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:34,350 INFO ]: Computing forward predicates... [2018-06-22 11:58:34,379 INFO ]: Checked inductivity of 151 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 11:58:34,410 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:34,410 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-22 11:58:34,410 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:58:34,411 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:58:34,411 INFO ]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:58:34,411 INFO ]: Start difference. First operand 149 states and 300 transitions. Second operand 15 states. [2018-06-22 11:58:35,013 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:35,013 INFO ]: Finished difference Result 391 states and 815 transitions. [2018-06-22 11:58:35,013 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:58:35,013 INFO ]: Start accepts. Automaton has 15 states. Word has length 45 [2018-06-22 11:58:35,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:35,016 INFO ]: With dead ends: 391 [2018-06-22 11:58:35,016 INFO ]: Without dead ends: 391 [2018-06-22 11:58:35,017 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=680, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:58:35,017 INFO ]: Start minimizeSevpa. Operand 391 states. [2018-06-22 11:58:35,039 INFO ]: Finished minimizeSevpa. Reduced states from 391 to 165. [2018-06-22 11:58:35,039 INFO ]: Start removeUnreachable. Operand 165 states. [2018-06-22 11:58:35,041 INFO ]: Finished removeUnreachable. Reduced from 165 states to 165 states and 333 transitions. [2018-06-22 11:58:35,041 INFO ]: Start accepts. Automaton has 165 states and 333 transitions. Word has length 45 [2018-06-22 11:58:35,041 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:35,041 INFO ]: Abstraction has 165 states and 333 transitions. [2018-06-22 11:58:35,041 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:58:35,041 INFO ]: Start isEmpty. Operand 165 states and 333 transitions. [2018-06-22 11:58:35,044 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:58:35,044 INFO ]: Found error trace [2018-06-22 11:58:35,044 INFO ]: trace histogram [11, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:35,044 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:35,044 INFO ]: Analyzing trace with hash -844142241, now seen corresponding path program 6 times [2018-06-22 11:58:35,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:35,044 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:35,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:35,045 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:35,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:35,055 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:35,174 INFO ]: Checked inductivity of 194 backedges. 7 proven. 48 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-06-22 11:58:35,174 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:35,174 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:35,180 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:58:35,194 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:58:35,194 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:35,196 INFO ]: Computing forward predicates... [2018-06-22 11:58:35,255 INFO ]: Checked inductivity of 194 backedges. 55 proven. 6 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-06-22 11:58:35,275 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:35,275 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 11:58:35,275 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:58:35,276 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:58:35,276 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:58:35,276 INFO ]: Start difference. First operand 165 states and 333 transitions. Second operand 12 states. [2018-06-22 11:58:36,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:36,047 INFO ]: Finished difference Result 393 states and 824 transitions. [2018-06-22 11:58:36,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:58:36,047 INFO ]: Start accepts. Automaton has 12 states. Word has length 49 [2018-06-22 11:58:36,047 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:36,051 INFO ]: With dead ends: 393 [2018-06-22 11:58:36,051 INFO ]: Without dead ends: 393 [2018-06-22 11:58:36,051 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:58:36,051 INFO ]: Start minimizeSevpa. Operand 393 states. [2018-06-22 11:58:36,076 INFO ]: Finished minimizeSevpa. Reduced states from 393 to 191. [2018-06-22 11:58:36,076 INFO ]: Start removeUnreachable. Operand 191 states. [2018-06-22 11:58:36,080 INFO ]: Finished removeUnreachable. Reduced from 191 states to 191 states and 386 transitions. [2018-06-22 11:58:36,080 INFO ]: Start accepts. Automaton has 191 states and 386 transitions. Word has length 49 [2018-06-22 11:58:36,080 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:36,080 INFO ]: Abstraction has 191 states and 386 transitions. [2018-06-22 11:58:36,080 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:58:36,080 INFO ]: Start isEmpty. Operand 191 states and 386 transitions. [2018-06-22 11:58:36,083 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:58:36,083 INFO ]: Found error trace [2018-06-22 11:58:36,083 INFO ]: trace histogram [11, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:36,084 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:36,086 INFO ]: Analyzing trace with hash 1203167317, now seen corresponding path program 7 times [2018-06-22 11:58:36,086 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:36,086 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:36,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:36,087 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:36,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:36,097 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:36,684 INFO ]: Checked inductivity of 186 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:58:36,684 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:36,684 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:36,691 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:36,711 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:36,713 INFO ]: Computing forward predicates... [2018-06-22 11:58:36,922 INFO ]: Checked inductivity of 186 backedges. 12 proven. 76 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-22 11:58:36,940 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:36,940 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 28 [2018-06-22 11:58:36,941 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:58:36,941 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:58:36,941 INFO ]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:58:36,941 INFO ]: Start difference. First operand 191 states and 386 transitions. Second operand 28 states. [2018-06-22 11:58:39,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:39,820 INFO ]: Finished difference Result 1000 states and 2199 transitions. [2018-06-22 11:58:39,820 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 11:58:39,820 INFO ]: Start accepts. Automaton has 28 states. Word has length 49 [2018-06-22 11:58:39,821 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:39,834 INFO ]: With dead ends: 1000 [2018-06-22 11:58:39,834 INFO ]: Without dead ends: 994 [2018-06-22 11:58:39,835 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=771, Invalid=2769, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 11:58:39,836 INFO ]: Start minimizeSevpa. Operand 994 states. [2018-06-22 11:58:39,921 INFO ]: Finished minimizeSevpa. Reduced states from 994 to 674. [2018-06-22 11:58:39,921 INFO ]: Start removeUnreachable. Operand 674 states. [2018-06-22 11:58:39,928 INFO ]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1615 transitions. [2018-06-22 11:58:39,928 INFO ]: Start accepts. Automaton has 674 states and 1615 transitions. Word has length 49 [2018-06-22 11:58:39,929 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:39,929 INFO ]: Abstraction has 674 states and 1615 transitions. [2018-06-22 11:58:39,929 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:58:39,929 INFO ]: Start isEmpty. Operand 674 states and 1615 transitions. [2018-06-22 11:58:39,940 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:58:39,940 INFO ]: Found error trace [2018-06-22 11:58:39,940 INFO ]: trace histogram [11, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:39,940 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:39,941 INFO ]: Analyzing trace with hash -30871248, now seen corresponding path program 8 times [2018-06-22 11:58:39,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:39,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:39,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:39,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:39,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:39,952 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:40,617 INFO ]: Checked inductivity of 185 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 11:58:40,618 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:40,618 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:40,624 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:58:40,644 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:58:40,644 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:40,646 INFO ]: Computing forward predicates... [2018-06-22 11:58:40,809 INFO ]: Checked inductivity of 185 backedges. 10 proven. 88 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-22 11:58:40,828 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:40,828 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2018-06-22 11:58:40,828 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:58:40,828 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:58:40,828 INFO ]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:58:40,828 INFO ]: Start difference. First operand 674 states and 1615 transitions. Second operand 29 states. [2018-06-22 11:58:43,676 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:43,676 INFO ]: Finished difference Result 1178 states and 2720 transitions. [2018-06-22 11:58:43,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 11:58:43,676 INFO ]: Start accepts. Automaton has 29 states. Word has length 49 [2018-06-22 11:58:43,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:43,687 INFO ]: With dead ends: 1178 [2018-06-22 11:58:43,687 INFO ]: Without dead ends: 1178 [2018-06-22 11:58:43,688 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=742, Invalid=2918, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 11:58:43,689 INFO ]: Start minimizeSevpa. Operand 1178 states. [2018-06-22 11:58:43,817 INFO ]: Finished minimizeSevpa. Reduced states from 1178 to 774. [2018-06-22 11:58:43,817 INFO ]: Start removeUnreachable. Operand 774 states. [2018-06-22 11:58:43,824 INFO ]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1803 transitions. [2018-06-22 11:58:43,824 INFO ]: Start accepts. Automaton has 774 states and 1803 transitions. Word has length 49 [2018-06-22 11:58:43,824 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:43,824 INFO ]: Abstraction has 774 states and 1803 transitions. [2018-06-22 11:58:43,824 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:58:43,824 INFO ]: Start isEmpty. Operand 774 states and 1803 transitions. [2018-06-22 11:58:43,837 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:58:43,837 INFO ]: Found error trace [2018-06-22 11:58:43,837 INFO ]: trace histogram [11, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:43,837 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:43,838 INFO ]: Analyzing trace with hash -734378421, now seen corresponding path program 9 times [2018-06-22 11:58:43,838 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:43,838 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:43,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:43,838 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:43,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:43,850 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:44,888 WARN ]: Spent 536.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-06-22 11:58:45,082 INFO ]: Checked inductivity of 186 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:58:45,082 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:45,082 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:45,087 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:58:45,102 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:58:45,102 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:45,103 INFO ]: Computing forward predicates... [2018-06-22 11:58:45,180 INFO ]: Checked inductivity of 186 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-06-22 11:58:45,199 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:45,199 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6] total 21 [2018-06-22 11:58:45,199 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:58:45,199 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:58:45,199 INFO ]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:58:45,199 INFO ]: Start difference. First operand 774 states and 1803 transitions. Second operand 21 states. [2018-06-22 11:58:45,752 WARN ]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 11:58:48,440 WARN ]: Spent 177.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-06-22 11:58:49,773 WARN ]: Spent 248.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-06-22 11:58:52,790 WARN ]: Spent 509.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 24 [2018-06-22 11:58:53,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:53,699 INFO ]: Finished difference Result 4441 states and 10064 transitions. [2018-06-22 11:58:53,699 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-06-22 11:58:53,699 INFO ]: Start accepts. Automaton has 21 states. Word has length 49 [2018-06-22 11:58:53,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:53,733 INFO ]: With dead ends: 4441 [2018-06-22 11:58:53,733 INFO ]: Without dead ends: 2388 [2018-06-22 11:58:53,737 INFO ]: 0 DeclaredPredicates, 164 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3572 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1517, Invalid=10255, Unknown=0, NotChecked=0, Total=11772 [2018-06-22 11:58:53,738 INFO ]: Start minimizeSevpa. Operand 2388 states. [2018-06-22 11:58:54,023 INFO ]: Finished minimizeSevpa. Reduced states from 2388 to 760. [2018-06-22 11:58:54,023 INFO ]: Start removeUnreachable. Operand 760 states. [2018-06-22 11:58:54,029 INFO ]: Finished removeUnreachable. Reduced from 760 states to 760 states and 2058 transitions. [2018-06-22 11:58:54,029 INFO ]: Start accepts. Automaton has 760 states and 2058 transitions. Word has length 49 [2018-06-22 11:58:54,029 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:54,029 INFO ]: Abstraction has 760 states and 2058 transitions. [2018-06-22 11:58:54,029 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:58:54,029 INFO ]: Start isEmpty. Operand 760 states and 2058 transitions. [2018-06-22 11:58:54,041 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:58:54,041 INFO ]: Found error trace [2018-06-22 11:58:54,041 INFO ]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:54,041 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:54,041 INFO ]: Analyzing trace with hash -1770495022, now seen corresponding path program 1 times [2018-06-22 11:58:54,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:54,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:54,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:54,042 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:54,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:54,053 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:54,533 WARN ]: Spent 430.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2018-06-22 11:58:54,809 INFO ]: Checked inductivity of 210 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-06-22 11:58:54,809 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:54,809 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:54,814 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:54,855 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:54,857 INFO ]: Computing forward predicates... [2018-06-22 11:58:54,870 INFO ]: Checked inductivity of 210 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-06-22 11:58:54,888 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:54,888 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-06-22 11:58:54,888 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:58:54,888 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:58:54,888 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:58:54,889 INFO ]: Start difference. First operand 760 states and 2058 transitions. Second operand 6 states. [2018-06-22 11:58:54,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:54,939 INFO ]: Finished difference Result 994 states and 2582 transitions. [2018-06-22 11:58:54,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:58:54,939 INFO ]: Start accepts. Automaton has 6 states. Word has length 49 [2018-06-22 11:58:54,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:54,949 INFO ]: With dead ends: 994 [2018-06-22 11:58:54,949 INFO ]: Without dead ends: 994 [2018-06-22 11:58:54,950 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:58:54,950 INFO ]: Start minimizeSevpa. Operand 994 states. [2018-06-22 11:58:55,109 INFO ]: Finished minimizeSevpa. Reduced states from 994 to 762. [2018-06-22 11:58:55,109 INFO ]: Start removeUnreachable. Operand 762 states. [2018-06-22 11:58:55,116 INFO ]: Finished removeUnreachable. Reduced from 762 states to 762 states and 2067 transitions. [2018-06-22 11:58:55,116 INFO ]: Start accepts. Automaton has 762 states and 2067 transitions. Word has length 49 [2018-06-22 11:58:55,116 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:55,116 INFO ]: Abstraction has 762 states and 2067 transitions. [2018-06-22 11:58:55,116 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:58:55,116 INFO ]: Start isEmpty. Operand 762 states and 2067 transitions. [2018-06-22 11:58:55,128 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:58:55,128 INFO ]: Found error trace [2018-06-22 11:58:55,128 INFO ]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:55,128 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:55,128 INFO ]: Analyzing trace with hash -1970404041, now seen corresponding path program 2 times [2018-06-22 11:58:55,128 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:55,128 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:55,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:55,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:58:55,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:55,143 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:55,754 WARN ]: Spent 545.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-06-22 11:58:55,994 WARN ]: Spent 188.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-06-22 11:58:56,168 INFO ]: Checked inductivity of 210 backedges. 32 proven. 110 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:58:56,168 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:56,168 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:56,174 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:58:56,195 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:58:56,195 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:56,198 INFO ]: Computing forward predicates... [2018-06-22 11:58:56,463 INFO ]: Checked inductivity of 210 backedges. 110 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:58:56,481 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:56,481 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2018-06-22 11:58:56,482 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:58:56,482 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:58:56,482 INFO ]: CoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:58:56,482 INFO ]: Start difference. First operand 762 states and 2067 transitions. Second operand 31 states. [2018-06-22 11:58:57,537 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:58:57,537 INFO ]: Finished difference Result 1122 states and 2995 transitions. [2018-06-22 11:58:57,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 11:58:57,542 INFO ]: Start accepts. Automaton has 31 states. Word has length 49 [2018-06-22 11:58:57,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:58:57,556 INFO ]: With dead ends: 1122 [2018-06-22 11:58:57,556 INFO ]: Without dead ends: 1114 [2018-06-22 11:58:57,556 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=679, Invalid=1673, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:58:57,557 INFO ]: Start minimizeSevpa. Operand 1114 states. [2018-06-22 11:58:57,772 INFO ]: Finished minimizeSevpa. Reduced states from 1114 to 820. [2018-06-22 11:58:57,772 INFO ]: Start removeUnreachable. Operand 820 states. [2018-06-22 11:58:57,778 INFO ]: Finished removeUnreachable. Reduced from 820 states to 820 states and 2278 transitions. [2018-06-22 11:58:57,778 INFO ]: Start accepts. Automaton has 820 states and 2278 transitions. Word has length 49 [2018-06-22 11:58:57,779 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:58:57,779 INFO ]: Abstraction has 820 states and 2278 transitions. [2018-06-22 11:58:57,779 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:58:57,779 INFO ]: Start isEmpty. Operand 820 states and 2278 transitions. [2018-06-22 11:58:57,791 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:58:57,791 INFO ]: Found error trace [2018-06-22 11:58:57,791 INFO ]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:58:57,791 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:58:57,791 INFO ]: Analyzing trace with hash -1337026652, now seen corresponding path program 2 times [2018-06-22 11:58:57,791 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:58:57,791 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:58:57,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:57,792 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:58:57,792 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:58:57,802 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:58,384 WARN ]: Spent 522.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-06-22 11:58:58,646 INFO ]: Checked inductivity of 210 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:58:58,646 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:58:58,646 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:58,651 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:58:58,673 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:58:58,673 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:58:58,676 INFO ]: Computing forward predicates... [2018-06-22 11:58:58,968 INFO ]: Checked inductivity of 210 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:58:58,986 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:58:58,987 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-06-22 11:58:58,987 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:58:58,987 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:58:58,987 INFO ]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:58:58,987 INFO ]: Start difference. First operand 820 states and 2278 transitions. Second operand 29 states. [2018-06-22 11:59:00,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:00,010 INFO ]: Finished difference Result 1462 states and 3934 transitions. [2018-06-22 11:59:00,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:59:00,010 INFO ]: Start accepts. Automaton has 29 states. Word has length 49 [2018-06-22 11:59:00,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:00,019 INFO ]: With dead ends: 1462 [2018-06-22 11:59:00,019 INFO ]: Without dead ends: 1462 [2018-06-22 11:59:00,019 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=174, Invalid=1806, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:59:00,020 INFO ]: Start minimizeSevpa. Operand 1462 states. [2018-06-22 11:59:00,188 INFO ]: Finished minimizeSevpa. Reduced states from 1462 to 850. [2018-06-22 11:59:00,188 INFO ]: Start removeUnreachable. Operand 850 states. [2018-06-22 11:59:00,193 INFO ]: Finished removeUnreachable. Reduced from 850 states to 850 states and 2366 transitions. [2018-06-22 11:59:00,194 INFO ]: Start accepts. Automaton has 850 states and 2366 transitions. Word has length 49 [2018-06-22 11:59:00,194 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:00,194 INFO ]: Abstraction has 850 states and 2366 transitions. [2018-06-22 11:59:00,194 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:59:00,194 INFO ]: Start isEmpty. Operand 850 states and 2366 transitions. [2018-06-22 11:59:00,207 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:59:00,207 INFO ]: Found error trace [2018-06-22 11:59:00,207 INFO ]: trace histogram [11, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:00,207 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:00,208 INFO ]: Analyzing trace with hash 5022446, now seen corresponding path program 9 times [2018-06-22 11:59:00,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:00,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:00,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:00,208 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:59:00,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:00,218 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:00,483 INFO ]: Checked inductivity of 201 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:59:00,483 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:00,483 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:59:00,489 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:59:00,520 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 11:59:00,520 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:00,524 INFO ]: Computing forward predicates... [2018-06-22 11:59:00,767 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:59:00,785 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:00,785 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-06-22 11:59:00,786 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:59:00,786 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:59:00,786 INFO ]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:59:00,786 INFO ]: Start difference. First operand 850 states and 2366 transitions. Second operand 30 states. [2018-06-22 11:59:02,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:02,938 INFO ]: Finished difference Result 1268 states and 3213 transitions. [2018-06-22 11:59:02,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 11:59:02,958 INFO ]: Start accepts. Automaton has 30 states. Word has length 49 [2018-06-22 11:59:02,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:02,965 INFO ]: With dead ends: 1268 [2018-06-22 11:59:02,965 INFO ]: Without dead ends: 1268 [2018-06-22 11:59:02,966 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=414, Invalid=3492, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 11:59:02,966 INFO ]: Start minimizeSevpa. Operand 1268 states. [2018-06-22 11:59:03,061 INFO ]: Finished minimizeSevpa. Reduced states from 1268 to 850. [2018-06-22 11:59:03,061 INFO ]: Start removeUnreachable. Operand 850 states. [2018-06-22 11:59:03,067 INFO ]: Finished removeUnreachable. Reduced from 850 states to 850 states and 2361 transitions. [2018-06-22 11:59:03,067 INFO ]: Start accepts. Automaton has 850 states and 2361 transitions. Word has length 49 [2018-06-22 11:59:03,067 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:03,067 INFO ]: Abstraction has 850 states and 2361 transitions. [2018-06-22 11:59:03,067 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:59:03,067 INFO ]: Start isEmpty. Operand 850 states and 2361 transitions. [2018-06-22 11:59:03,080 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:59:03,080 INFO ]: Found error trace [2018-06-22 11:59:03,080 INFO ]: trace histogram [11, 7, 7, 7, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:03,080 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:03,080 INFO ]: Analyzing trace with hash -2005957118, now seen corresponding path program 10 times [2018-06-22 11:59:03,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:03,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:03,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:03,082 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:59:03,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:03,092 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:03,458 INFO ]: Checked inductivity of 189 backedges. 58 proven. 63 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:59:03,458 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:03,458 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) [2018-06-22 11:59:03,470 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:59:03,490 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:59:03,490 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:03,492 INFO ]: Computing forward predicates... [2018-06-22 11:59:03,686 INFO ]: Checked inductivity of 189 backedges. 22 proven. 92 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-06-22 11:59:03,704 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:03,704 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2018-06-22 11:59:03,704 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:59:03,704 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:59:03,705 INFO ]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:59:03,705 INFO ]: Start difference. First operand 850 states and 2361 transitions. Second operand 29 states. [2018-06-22 11:59:07,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:07,660 INFO ]: Finished difference Result 1316 states and 3063 transitions. [2018-06-22 11:59:07,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-06-22 11:59:07,660 INFO ]: Start accepts. Automaton has 29 states. Word has length 49 [2018-06-22 11:59:07,661 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:07,666 INFO ]: With dead ends: 1316 [2018-06-22 11:59:07,666 INFO ]: Without dead ends: 1107 [2018-06-22 11:59:07,668 INFO ]: 0 DeclaredPredicates, 148 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1233, Invalid=9273, Unknown=0, NotChecked=0, Total=10506 [2018-06-22 11:59:07,668 INFO ]: Start minimizeSevpa. Operand 1107 states. [2018-06-22 11:59:07,736 INFO ]: Finished minimizeSevpa. Reduced states from 1107 to 537. [2018-06-22 11:59:07,736 INFO ]: Start removeUnreachable. Operand 537 states. [2018-06-22 11:59:07,740 INFO ]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1499 transitions. [2018-06-22 11:59:07,740 INFO ]: Start accepts. Automaton has 537 states and 1499 transitions. Word has length 49 [2018-06-22 11:59:07,740 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:07,740 INFO ]: Abstraction has 537 states and 1499 transitions. [2018-06-22 11:59:07,740 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:59:07,740 INFO ]: Start isEmpty. Operand 537 states and 1499 transitions. [2018-06-22 11:59:07,746 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:59:07,746 INFO ]: Found error trace [2018-06-22 11:59:07,746 INFO ]: trace histogram [11, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:07,746 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:07,746 INFO ]: Analyzing trace with hash -410879264, now seen corresponding path program 11 times [2018-06-22 11:59:07,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:07,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:07,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:07,747 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:59:07,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:07,756 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:08,352 WARN ]: Spent 188.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-06-22 11:59:08,494 INFO ]: Checked inductivity of 186 backedges. 40 proven. 79 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 11:59:08,494 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:08,494 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:59:08,499 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:59:08,523 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-06-22 11:59:08,523 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:08,526 INFO ]: Computing forward predicates... [2018-06-22 11:59:09,395 WARN ]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-22 11:59:09,492 INFO ]: Checked inductivity of 186 backedges. 18 proven. 101 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-22 11:59:09,510 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:09,510 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2018-06-22 11:59:09,510 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:59:09,511 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:59:09,511 INFO ]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:59:09,511 INFO ]: Start difference. First operand 537 states and 1499 transitions. Second operand 31 states. [2018-06-22 11:59:10,499 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:10,499 INFO ]: Finished difference Result 1105 states and 2957 transitions. [2018-06-22 11:59:10,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:59:10,499 INFO ]: Start accepts. Automaton has 31 states. Word has length 49 [2018-06-22 11:59:10,500 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:10,505 INFO ]: With dead ends: 1105 [2018-06-22 11:59:10,505 INFO ]: Without dead ends: 1089 [2018-06-22 11:59:10,506 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=454, Invalid=1996, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:59:10,506 INFO ]: Start minimizeSevpa. Operand 1089 states. [2018-06-22 11:59:10,552 INFO ]: Finished minimizeSevpa. Reduced states from 1089 to 607. [2018-06-22 11:59:10,553 INFO ]: Start removeUnreachable. Operand 607 states. [2018-06-22 11:59:10,556 INFO ]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1655 transitions. [2018-06-22 11:59:10,557 INFO ]: Start accepts. Automaton has 607 states and 1655 transitions. Word has length 49 [2018-06-22 11:59:10,557 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:10,557 INFO ]: Abstraction has 607 states and 1655 transitions. [2018-06-22 11:59:10,557 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:59:10,557 INFO ]: Start isEmpty. Operand 607 states and 1655 transitions. [2018-06-22 11:59:10,563 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:59:10,563 INFO ]: Found error trace [2018-06-22 11:59:10,563 INFO ]: trace histogram [11, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:10,563 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:10,564 INFO ]: Analyzing trace with hash -1817893610, now seen corresponding path program 12 times [2018-06-22 11:59:10,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:10,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:10,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:10,565 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:59:10,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:10,575 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:11,079 INFO ]: Checked inductivity of 185 backedges. 42 proven. 75 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:59:11,079 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:11,079 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:59:11,085 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:59:11,110 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-22 11:59:11,110 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:11,113 INFO ]: Computing forward predicates... [2018-06-22 11:59:11,287 INFO ]: Checked inductivity of 185 backedges. 4 proven. 90 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:59:11,305 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:11,306 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 27 [2018-06-22 11:59:11,306 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:59:11,306 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:59:11,306 INFO ]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:59:11,306 INFO ]: Start difference. First operand 607 states and 1655 transitions. Second operand 27 states. [2018-06-22 11:59:12,084 WARN ]: Spent 200.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-06-22 11:59:12,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:12,718 INFO ]: Finished difference Result 1041 states and 2790 transitions. [2018-06-22 11:59:12,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:59:12,718 INFO ]: Start accepts. Automaton has 27 states. Word has length 49 [2018-06-22 11:59:12,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:12,724 INFO ]: With dead ends: 1041 [2018-06-22 11:59:12,724 INFO ]: Without dead ends: 1027 [2018-06-22 11:59:12,724 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=367, Invalid=1613, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:59:12,725 INFO ]: Start minimizeSevpa. Operand 1027 states. [2018-06-22 11:59:12,774 INFO ]: Finished minimizeSevpa. Reduced states from 1027 to 593. [2018-06-22 11:59:12,774 INFO ]: Start removeUnreachable. Operand 593 states. [2018-06-22 11:59:12,778 INFO ]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1636 transitions. [2018-06-22 11:59:12,778 INFO ]: Start accepts. Automaton has 593 states and 1636 transitions. Word has length 49 [2018-06-22 11:59:12,778 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:12,778 INFO ]: Abstraction has 593 states and 1636 transitions. [2018-06-22 11:59:12,778 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:59:12,778 INFO ]: Start isEmpty. Operand 593 states and 1636 transitions. Received shutdown request... [2018-06-22 11:59:12,917 WARN ]: Verification canceled [2018-06-22 11:59:12,924 WARN ]: Timeout [2018-06-22 11:59:12,924 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:59:12 BoogieIcfgContainer [2018-06-22 11:59:12,924 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:59:12,925 INFO ]: Toolchain (without parser) took 55855.45 ms. Allocated memory was 309.3 MB in the beginning and 823.7 MB in the end (delta: 514.3 MB). Free memory was 265.7 MB in the beginning and 789.7 MB in the end (delta: -524.0 MB). Peak memory consumption was 447.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:12,926 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:59:12,926 INFO ]: ChcToBoogie took 45.46 ms. Allocated memory is still 309.3 MB. Free memory is still 263.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:59:12,926 INFO ]: Boogie Preprocessor took 37.43 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 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:59:12,926 INFO ]: RCFGBuilder took 312.66 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 253.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:12,929 INFO ]: TraceAbstraction took 55448.44 ms. Allocated memory was 309.3 MB in the beginning and 823.7 MB in the end (delta: 514.3 MB). Free memory was 253.8 MB in the beginning and 789.7 MB in the end (delta: -535.9 MB). Peak memory consumption was 435.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:12,931 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 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 45.46 ms. Allocated memory is still 309.3 MB. Free memory is still 263.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.43 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 312.66 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 253.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55448.44 ms. Allocated memory was 309.3 MB in the beginning and 823.7 MB in the end (delta: 514.3 MB). Free memory was 253.8 MB in the beginning and 789.7 MB in the end (delta: -535.9 MB). Peak memory consumption was 435.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while IsEmpty was searching accepting run (input had 593 states). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. TIMEOUT Result, 55.3s OverallTime, 39 OverallIterations, 11 TraceHistogramMax, 34.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1008 SDtfs, 748 SDslu, 5931 SDs, 0 SdLazy, 18343 SolverSat, 2706 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2175 GetRequests, 1178 SyntacticMatches, 27 SemanticMatches, 970 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11526 ImplicationChecksByTransitivity, 30.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=850occurred in iteration=35, 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: 1.7s AutomataMinimizationTime, 39 MinimizatonAttempts, 6982 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 2334 NumberOfCodeBlocks, 2244 NumberOfCodeBlocksAsserted, 147 NumberOfCheckSat, 2260 ConstructedInterpolants, 0 QuantifiedInterpolants, 432060 SizeOfPredicates, 243 NumberOfNonLiveVariables, 4583 ConjunctsInSsa, 1002 ConjunctsInUnsatCore, 74 InterpolantComputations, 8 PerfectInterpolantSequences, 3818/6610 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-59-12-948.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__break.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-59-12-948.csv Completed graceful shutdown