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/eldarica-misc/LIA/reve/025-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:22:40,817 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:22:40,819 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:22:40,830 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:22:40,830 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:22:40,831 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:22:40,832 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:22:40,834 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:22:40,835 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:22:40,836 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:22:40,837 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:22:40,837 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:22:40,838 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:22:40,839 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:22:40,840 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:22:40,840 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:22:40,842 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:22:40,844 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:22:40,845 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:22:40,847 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:22:40,848 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:22:40,850 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:22:40,850 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:22:40,851 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:22:40,851 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:22:40,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:22:40,853 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:22:40,854 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:22:40,855 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:22:40,855 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:22:40,856 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:22:40,856 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:22:40,857 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:22:40,858 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:22:40,858 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:22:40,859 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:22:40,872 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:22:40,872 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:22:40,873 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:22:40,873 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:22:40,874 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:22:40,874 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:22:40,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:22:40,875 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:22:40,875 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:22:40,875 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:22:40,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:22:40,875 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:22:40,876 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:22:40,876 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:22:40,876 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:22:40,876 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:22:40,877 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:22:40,877 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:22:40,877 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:22:40,878 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:22:40,879 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:22:40,916 INFO ]: Repository-Root is: /tmp [2018-06-22 11:22:40,937 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:22:40,942 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:22:40,943 INFO ]: Initializing SmtParser... [2018-06-22 11:22:40,943 INFO ]: SmtParser initialized [2018-06-22 11:22:40,944 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/025-horn.smt2 [2018-06-22 11:22:40,945 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:22:41,037 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025-horn.smt2 unknown [2018-06-22 11:22:41,306 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025-horn.smt2 [2018-06-22 11:22:41,311 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:22:41,317 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:22:41,317 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:22:41,317 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:22:41,318 INFO ]: ChcToBoogie initialized [2018-06-22 11:22:41,322 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:22:41" (1/1) ... [2018-06-22 11:22:41,378 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:41 Unit [2018-06-22 11:22:41,378 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:22:41,379 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:22:41,379 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:22:41,379 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:22:41,405 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:41" (1/1) ... [2018-06-22 11:22:41,405 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:41" (1/1) ... [2018-06-22 11:22:41,414 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:41" (1/1) ... [2018-06-22 11:22:41,414 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:41" (1/1) ... [2018-06-22 11:22:41,433 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:41" (1/1) ... [2018-06-22 11:22:41,435 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:41" (1/1) ... [2018-06-22 11:22:41,437 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:41" (1/1) ... [2018-06-22 11:22:41,444 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:22:41,445 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:22:41,445 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:22:41,445 INFO ]: RCFGBuilder initialized [2018-06-22 11:22:41,446 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:41" (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:22:41,472 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:22:41,472 INFO ]: Found specification of procedure False [2018-06-22 11:22:41,472 INFO ]: Found implementation of procedure False [2018-06-22 11:22:41,472 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:22:41,473 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:22:41,473 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:22:41,473 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:22:41,473 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:22:41,473 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:22:41,473 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:22:41,473 INFO ]: Found specification of procedure REC__f [2018-06-22 11:22:41,473 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:22:41,473 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:22:41,473 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:22:41,473 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:22:42,089 INFO ]: Using library mode [2018-06-22 11:22:42,090 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:22:42 BoogieIcfgContainer [2018-06-22 11:22:42,090 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:22:42,092 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:22:42,092 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:22:42,095 INFO ]: TraceAbstraction initialized [2018-06-22 11:22:42,095 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:22:41" (1/3) ... [2018-06-22 11:22:42,096 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5620ae3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:22:42, skipping insertion in model container [2018-06-22 11:22:42,096 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:22:41" (2/3) ... [2018-06-22 11:22:42,096 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5620ae3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:22:42, skipping insertion in model container [2018-06-22 11:22:42,096 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:22:42" (3/3) ... [2018-06-22 11:22:42,098 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:22:42,107 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:22:42,116 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:22:42,166 INFO ]: Using default assertion order modulation [2018-06-22 11:22:42,167 INFO ]: Interprodecural is true [2018-06-22 11:22:42,167 INFO ]: Hoare is false [2018-06-22 11:22:42,167 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:22:42,167 INFO ]: Backedges is TWOTRACK [2018-06-22 11:22:42,167 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:22:42,167 INFO ]: Difference is false [2018-06-22 11:22:42,167 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:22:42,167 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:22:42,187 INFO ]: Start isEmpty. Operand 39 states. [2018-06-22 11:22:42,216 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:22:42,217 INFO ]: Found error trace [2018-06-22 11:22:42,218 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:42,218 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:42,223 INFO ]: Analyzing trace with hash -692693388, now seen corresponding path program 1 times [2018-06-22 11:22:42,225 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:42,226 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:42,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:42,274 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:42,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:42,319 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:42,661 WARN ]: Spent 225.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-06-22 11:22:42,664 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:22:42,666 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:22:42,666 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:22:42,667 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:22:42,677 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:22:42,678 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:22:42,680 INFO ]: Start difference. First operand 39 states. Second operand 4 states. [2018-06-22 11:22:43,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:43,211 INFO ]: Finished difference Result 39 states and 86 transitions. [2018-06-22 11:22:43,211 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:22:43,212 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:22:43,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:43,225 INFO ]: With dead ends: 39 [2018-06-22 11:22:43,225 INFO ]: Without dead ends: 39 [2018-06-22 11:22:43,227 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:22:43,246 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:22:43,284 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 11:22:43,286 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:22:43,287 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 86 transitions. [2018-06-22 11:22:43,288 INFO ]: Start accepts. Automaton has 39 states and 86 transitions. Word has length 9 [2018-06-22 11:22:43,289 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:43,289 INFO ]: Abstraction has 39 states and 86 transitions. [2018-06-22 11:22:43,289 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:22:43,289 INFO ]: Start isEmpty. Operand 39 states and 86 transitions. [2018-06-22 11:22:43,296 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:22:43,296 INFO ]: Found error trace [2018-06-22 11:22:43,296 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:43,296 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:43,296 INFO ]: Analyzing trace with hash -1272860175, now seen corresponding path program 1 times [2018-06-22 11:22:43,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:43,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:43,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:43,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:43,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:43,307 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:43,439 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:22:43,440 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:43,440 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:43,450 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:43,463 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:43,468 INFO ]: Computing forward predicates... [2018-06-22 11:22:43,505 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:22:43,542 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:43,542 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:22:43,543 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:22:43,543 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:22:43,543 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:22:43,543 INFO ]: Start difference. First operand 39 states and 86 transitions. Second operand 6 states. [2018-06-22 11:22:44,427 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:44,428 INFO ]: Finished difference Result 47 states and 128 transitions. [2018-06-22 11:22:44,429 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:22:44,429 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:22:44,429 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:44,432 INFO ]: With dead ends: 47 [2018-06-22 11:22:44,432 INFO ]: Without dead ends: 47 [2018-06-22 11:22:44,432 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:22:44,432 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:22:44,452 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:22:44,452 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:22:44,454 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 107 transitions. [2018-06-22 11:22:44,454 INFO ]: Start accepts. Automaton has 43 states and 107 transitions. Word has length 13 [2018-06-22 11:22:44,454 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:44,454 INFO ]: Abstraction has 43 states and 107 transitions. [2018-06-22 11:22:44,454 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:22:44,454 INFO ]: Start isEmpty. Operand 43 states and 107 transitions. [2018-06-22 11:22:44,457 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:22:44,457 INFO ]: Found error trace [2018-06-22 11:22:44,457 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:44,457 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:44,458 INFO ]: Analyzing trace with hash 198644943, now seen corresponding path program 1 times [2018-06-22 11:22:44,458 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:44,458 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:44,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:44,458 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:44,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:44,472 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:44,509 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:22:44,509 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:22:44,509 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:22:44,510 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:22:44,510 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:22:44,510 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:22:44,510 INFO ]: Start difference. First operand 43 states and 107 transitions. Second operand 4 states. [2018-06-22 11:22:44,596 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:44,596 INFO ]: Finished difference Result 47 states and 127 transitions. [2018-06-22 11:22:44,596 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:22:44,596 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:22:44,596 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:44,599 INFO ]: With dead ends: 47 [2018-06-22 11:22:44,599 INFO ]: Without dead ends: 47 [2018-06-22 11:22:44,599 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:22:44,600 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:22:44,614 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:22:44,614 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:22:44,616 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 107 transitions. [2018-06-22 11:22:44,616 INFO ]: Start accepts. Automaton has 43 states and 107 transitions. Word has length 13 [2018-06-22 11:22:44,616 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:44,616 INFO ]: Abstraction has 43 states and 107 transitions. [2018-06-22 11:22:44,616 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:22:44,616 INFO ]: Start isEmpty. Operand 43 states and 107 transitions. [2018-06-22 11:22:44,618 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:22:44,618 INFO ]: Found error trace [2018-06-22 11:22:44,618 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:44,618 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:44,618 INFO ]: Analyzing trace with hash 950314363, now seen corresponding path program 1 times [2018-06-22 11:22:44,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:44,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:44,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:44,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:44,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:44,634 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:44,725 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:22:44,725 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:22:44,725 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:22:44,725 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:22:44,725 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:22:44,725 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:22:44,725 INFO ]: Start difference. First operand 43 states and 107 transitions. Second operand 4 states. [2018-06-22 11:22:45,054 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:45,055 INFO ]: Finished difference Result 47 states and 126 transitions. [2018-06-22 11:22:45,056 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:22:45,056 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:22:45,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:45,058 INFO ]: With dead ends: 47 [2018-06-22 11:22:45,058 INFO ]: Without dead ends: 47 [2018-06-22 11:22:45,058 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:22:45,058 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:22:45,069 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-06-22 11:22:45,069 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:22:45,071 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 96 transitions. [2018-06-22 11:22:45,071 INFO ]: Start accepts. Automaton has 41 states and 96 transitions. Word has length 13 [2018-06-22 11:22:45,071 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:45,071 INFO ]: Abstraction has 41 states and 96 transitions. [2018-06-22 11:22:45,071 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:22:45,071 INFO ]: Start isEmpty. Operand 41 states and 96 transitions. [2018-06-22 11:22:45,072 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:22:45,072 INFO ]: Found error trace [2018-06-22 11:22:45,072 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:45,073 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:45,073 INFO ]: Analyzing trace with hash -537107616, now seen corresponding path program 1 times [2018-06-22 11:22:45,073 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:45,073 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:45,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:45,074 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:45,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:45,083 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:45,225 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:22:45,225 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:45,225 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:22:45,233 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:45,250 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:45,252 INFO ]: Computing forward predicates... [2018-06-22 11:22:45,319 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:22:45,342 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:45,343 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:22:45,343 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:22:45,343 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:22:45,343 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:22:45,343 INFO ]: Start difference. First operand 41 states and 96 transitions. Second operand 8 states. [2018-06-22 11:22:45,835 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:45,835 INFO ]: Finished difference Result 59 states and 188 transitions. [2018-06-22 11:22:45,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:22:45,840 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:22:45,841 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:45,843 INFO ]: With dead ends: 59 [2018-06-22 11:22:45,843 INFO ]: Without dead ends: 59 [2018-06-22 11:22:45,843 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:22:45,843 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 11:22:45,871 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 43. [2018-06-22 11:22:45,871 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:22:45,873 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 106 transitions. [2018-06-22 11:22:45,873 INFO ]: Start accepts. Automaton has 43 states and 106 transitions. Word has length 13 [2018-06-22 11:22:45,873 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:45,873 INFO ]: Abstraction has 43 states and 106 transitions. [2018-06-22 11:22:45,873 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:22:45,873 INFO ]: Start isEmpty. Operand 43 states and 106 transitions. [2018-06-22 11:22:45,874 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:22:45,874 INFO ]: Found error trace [2018-06-22 11:22:45,874 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:45,875 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:45,880 INFO ]: Analyzing trace with hash 443895796, now seen corresponding path program 1 times [2018-06-22 11:22:45,880 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:45,880 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:45,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:45,881 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:45,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:45,893 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:46,006 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:22:46,006 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:46,006 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:22:46,012 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:46,021 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:46,022 INFO ]: Computing forward predicates... [2018-06-22 11:22:46,068 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:22:46,089 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:46,089 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:22:46,089 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:22:46,089 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:22:46,089 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:22:46,090 INFO ]: Start difference. First operand 43 states and 106 transitions. Second operand 9 states. [2018-06-22 11:22:46,792 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:46,792 INFO ]: Finished difference Result 57 states and 177 transitions. [2018-06-22 11:22:46,792 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:22:46,792 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:22:46,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:46,793 INFO ]: With dead ends: 57 [2018-06-22 11:22:46,793 INFO ]: Without dead ends: 57 [2018-06-22 11:22:46,794 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:22:46,794 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:22:46,805 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 45. [2018-06-22 11:22:46,805 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:22:46,806 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 116 transitions. [2018-06-22 11:22:46,806 INFO ]: Start accepts. Automaton has 45 states and 116 transitions. Word has length 13 [2018-06-22 11:22:46,806 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:46,806 INFO ]: Abstraction has 45 states and 116 transitions. [2018-06-22 11:22:46,806 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:22:46,806 INFO ]: Start isEmpty. Operand 45 states and 116 transitions. [2018-06-22 11:22:46,808 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:46,808 INFO ]: Found error trace [2018-06-22 11:22:46,808 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:46,808 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:46,808 INFO ]: Analyzing trace with hash 1503218222, now seen corresponding path program 2 times [2018-06-22 11:22:46,808 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:46,808 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:46,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:46,809 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:46,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:46,819 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:46,887 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:46,887 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:46,887 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) [2018-06-22 11:22:46,904 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:46,917 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:22:46,917 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:46,919 INFO ]: Computing forward predicates... [2018-06-22 11:22:47,053 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:47,074 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:47,074 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:22:47,075 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:22:47,075 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:22:47,075 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:22:47,075 INFO ]: Start difference. First operand 45 states and 116 transitions. Second operand 10 states. [2018-06-22 11:22:47,449 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:47,449 INFO ]: Finished difference Result 53 states and 157 transitions. [2018-06-22 11:22:47,450 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:22:47,451 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:22:47,451 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:47,452 INFO ]: With dead ends: 53 [2018-06-22 11:22:47,452 INFO ]: Without dead ends: 53 [2018-06-22 11:22:47,452 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:22:47,453 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:22:47,461 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-06-22 11:22:47,461 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:22:47,463 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 136 transitions. [2018-06-22 11:22:47,463 INFO ]: Start accepts. Automaton has 49 states and 136 transitions. Word has length 17 [2018-06-22 11:22:47,463 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:47,463 INFO ]: Abstraction has 49 states and 136 transitions. [2018-06-22 11:22:47,463 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:22:47,463 INFO ]: Start isEmpty. Operand 49 states and 136 transitions. [2018-06-22 11:22:47,464 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:47,464 INFO ]: Found error trace [2018-06-22 11:22:47,464 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:47,465 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:47,465 INFO ]: Analyzing trace with hash 2085306141, now seen corresponding path program 1 times [2018-06-22 11:22:47,465 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:47,465 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:47,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:47,465 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:47,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:47,475 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:47,533 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:22:47,533 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:47,533 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:47,541 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:47,562 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:47,564 INFO ]: Computing forward predicates... [2018-06-22 11:22:47,725 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:22:47,744 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:47,744 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:22:47,744 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:22:47,744 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:22:47,744 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:22:47,744 INFO ]: Start difference. First operand 49 states and 136 transitions. Second operand 10 states. [2018-06-22 11:22:48,229 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:48,229 INFO ]: Finished difference Result 57 states and 177 transitions. [2018-06-22 11:22:48,229 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:22:48,230 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:22:48,230 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:48,231 INFO ]: With dead ends: 57 [2018-06-22 11:22:48,231 INFO ]: Without dead ends: 57 [2018-06-22 11:22:48,231 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:22:48,231 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:22:48,240 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-06-22 11:22:48,240 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:22:48,242 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 136 transitions. [2018-06-22 11:22:48,242 INFO ]: Start accepts. Automaton has 49 states and 136 transitions. Word has length 17 [2018-06-22 11:22:48,242 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:48,242 INFO ]: Abstraction has 49 states and 136 transitions. [2018-06-22 11:22:48,242 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:22:48,242 INFO ]: Start isEmpty. Operand 49 states and 136 transitions. [2018-06-22 11:22:48,244 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:48,244 INFO ]: Found error trace [2018-06-22 11:22:48,244 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:48,244 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:48,244 INFO ]: Analyzing trace with hash -1793021681, now seen corresponding path program 1 times [2018-06-22 11:22:48,244 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:48,244 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:48,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:48,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:48,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:48,261 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:48,314 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:22:48,314 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:22:48,314 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:22:48,314 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:22:48,314 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:22:48,314 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:22:48,314 INFO ]: Start difference. First operand 49 states and 136 transitions. Second operand 4 states. [2018-06-22 11:22:48,372 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:48,372 INFO ]: Finished difference Result 51 states and 144 transitions. [2018-06-22 11:22:48,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:22:48,372 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:22:48,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:48,373 INFO ]: With dead ends: 51 [2018-06-22 11:22:48,373 INFO ]: Without dead ends: 51 [2018-06-22 11:22:48,373 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:22:48,373 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:22:48,381 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-06-22 11:22:48,381 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:22:48,382 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 134 transitions. [2018-06-22 11:22:48,382 INFO ]: Start accepts. Automaton has 49 states and 134 transitions. Word has length 17 [2018-06-22 11:22:48,382 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:48,382 INFO ]: Abstraction has 49 states and 134 transitions. [2018-06-22 11:22:48,382 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:22:48,382 INFO ]: Start isEmpty. Operand 49 states and 134 transitions. [2018-06-22 11:22:48,384 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:48,384 INFO ]: Found error trace [2018-06-22 11:22:48,384 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:48,384 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:48,384 INFO ]: Analyzing trace with hash -508353770, now seen corresponding path program 1 times [2018-06-22 11:22:48,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:48,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:48,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:48,385 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:48,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:48,392 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:48,419 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:22:48,419 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:22:48,419 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:22:48,419 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:22:48,419 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:22:48,419 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:22:48,419 INFO ]: Start difference. First operand 49 states and 134 transitions. Second operand 4 states. [2018-06-22 11:22:48,691 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:48,691 INFO ]: Finished difference Result 57 states and 169 transitions. [2018-06-22 11:22:48,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:22:48,695 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:22:48,695 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:48,696 INFO ]: With dead ends: 57 [2018-06-22 11:22:48,696 INFO ]: Without dead ends: 57 [2018-06-22 11:22:48,696 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:22:48,697 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:22:48,710 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-06-22 11:22:48,710 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:22:48,715 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 128 transitions. [2018-06-22 11:22:48,716 INFO ]: Start accepts. Automaton has 49 states and 128 transitions. Word has length 17 [2018-06-22 11:22:48,716 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:48,716 INFO ]: Abstraction has 49 states and 128 transitions. [2018-06-22 11:22:48,716 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:22:48,716 INFO ]: Start isEmpty. Operand 49 states and 128 transitions. [2018-06-22 11:22:48,717 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:48,717 INFO ]: Found error trace [2018-06-22 11:22:48,717 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:48,718 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:48,718 INFO ]: Analyzing trace with hash -337676249, now seen corresponding path program 1 times [2018-06-22 11:22:48,718 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:48,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:48,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:48,718 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:48,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:48,729 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:48,857 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:48,857 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:22:48,857 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:22:48,857 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:22:48,857 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:22:48,857 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:22:48,857 INFO ]: Start difference. First operand 49 states and 128 transitions. Second operand 4 states. [2018-06-22 11:22:48,926 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:48,927 INFO ]: Finished difference Result 53 states and 144 transitions. [2018-06-22 11:22:48,927 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:22:48,927 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:22:48,927 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:48,928 INFO ]: With dead ends: 53 [2018-06-22 11:22:48,928 INFO ]: Without dead ends: 53 [2018-06-22 11:22:48,928 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:22:48,928 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:22:48,938 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-06-22 11:22:48,938 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:22:48,941 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 134 transitions. [2018-06-22 11:22:48,941 INFO ]: Start accepts. Automaton has 51 states and 134 transitions. Word has length 17 [2018-06-22 11:22:48,942 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:48,942 INFO ]: Abstraction has 51 states and 134 transitions. [2018-06-22 11:22:48,942 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:22:48,942 INFO ]: Start isEmpty. Operand 51 states and 134 transitions. [2018-06-22 11:22:48,943 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:48,944 INFO ]: Found error trace [2018-06-22 11:22:48,944 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:48,944 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:48,944 INFO ]: Analyzing trace with hash -893523387, now seen corresponding path program 1 times [2018-06-22 11:22:48,944 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:48,944 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:48,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:48,945 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:48,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:48,951 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:49,020 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:49,020 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:22:49,020 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:22:49,020 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:22:49,020 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:22:49,020 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:22:49,020 INFO ]: Start difference. First operand 51 states and 134 transitions. Second operand 4 states. [2018-06-22 11:22:49,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:49,164 INFO ]: Finished difference Result 61 states and 184 transitions. [2018-06-22 11:22:49,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:22:49,164 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:22:49,165 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:49,166 INFO ]: With dead ends: 61 [2018-06-22 11:22:49,166 INFO ]: Without dead ends: 61 [2018-06-22 11:22:49,166 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:22:49,166 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:22:49,174 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 51. [2018-06-22 11:22:49,174 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:22:49,175 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 133 transitions. [2018-06-22 11:22:49,175 INFO ]: Start accepts. Automaton has 51 states and 133 transitions. Word has length 17 [2018-06-22 11:22:49,175 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:49,175 INFO ]: Abstraction has 51 states and 133 transitions. [2018-06-22 11:22:49,175 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:22:49,175 INFO ]: Start isEmpty. Operand 51 states and 133 transitions. [2018-06-22 11:22:49,176 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:49,176 INFO ]: Found error trace [2018-06-22 11:22:49,176 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:49,176 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:49,176 INFO ]: Analyzing trace with hash 473911500, now seen corresponding path program 2 times [2018-06-22 11:22:49,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:49,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:49,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:49,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:49,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:49,186 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:49,324 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:49,324 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:49,324 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:22:49,332 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:22:49,342 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:22:49,342 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:49,346 INFO ]: Computing forward predicates... [2018-06-22 11:22:49,446 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:49,471 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:49,471 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:22:49,471 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:22:49,471 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:22:49,471 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:22:49,472 INFO ]: Start difference. First operand 51 states and 133 transitions. Second operand 12 states. [2018-06-22 11:22:50,054 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:50,054 INFO ]: Finished difference Result 65 states and 204 transitions. [2018-06-22 11:22:50,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:22:50,055 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:22:50,055 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:50,056 INFO ]: With dead ends: 65 [2018-06-22 11:22:50,056 INFO ]: Without dead ends: 65 [2018-06-22 11:22:50,056 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:22:50,056 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:22:50,066 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 55. [2018-06-22 11:22:50,066 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:22:50,067 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 153 transitions. [2018-06-22 11:22:50,067 INFO ]: Start accepts. Automaton has 55 states and 153 transitions. Word has length 17 [2018-06-22 11:22:50,067 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:50,067 INFO ]: Abstraction has 55 states and 153 transitions. [2018-06-22 11:22:50,067 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:22:50,067 INFO ]: Start isEmpty. Operand 55 states and 153 transitions. [2018-06-22 11:22:50,068 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:50,068 INFO ]: Found error trace [2018-06-22 11:22:50,069 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:50,069 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:50,069 INFO ]: Analyzing trace with hash -2001341418, now seen corresponding path program 1 times [2018-06-22 11:22:50,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:50,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:50,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:50,070 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:50,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:50,077 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:50,135 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:22:50,135 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:50,135 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:50,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:50,167 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:50,169 INFO ]: Computing forward predicates... [2018-06-22 11:22:50,278 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:50,298 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:50,298 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-22 11:22:50,298 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:22:50,298 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:22:50,298 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:22:50,298 INFO ]: Start difference. First operand 55 states and 153 transitions. Second operand 12 states. [2018-06-22 11:22:52,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:52,116 INFO ]: Finished difference Result 95 states and 358 transitions. [2018-06-22 11:22:52,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:22:52,116 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:22:52,116 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:52,118 INFO ]: With dead ends: 95 [2018-06-22 11:22:52,118 INFO ]: Without dead ends: 95 [2018-06-22 11:22:52,118 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:22:52,118 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 11:22:52,141 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 61. [2018-06-22 11:22:52,141 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:22:52,142 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 185 transitions. [2018-06-22 11:22:52,142 INFO ]: Start accepts. Automaton has 61 states and 185 transitions. Word has length 17 [2018-06-22 11:22:52,142 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:52,142 INFO ]: Abstraction has 61 states and 185 transitions. [2018-06-22 11:22:52,142 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:22:52,142 INFO ]: Start isEmpty. Operand 61 states and 185 transitions. [2018-06-22 11:22:52,148 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:52,148 INFO ]: Found error trace [2018-06-22 11:22:52,148 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:52,149 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:52,149 INFO ]: Analyzing trace with hash -181627040, now seen corresponding path program 1 times [2018-06-22 11:22:52,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:52,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:52,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:52,149 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:52,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:52,164 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:52,235 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:52,235 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:52,235 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:22:52,241 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:52,251 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:52,252 INFO ]: Computing forward predicates... [2018-06-22 11:22:52,364 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:22:52,383 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:52,383 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-22 11:22:52,383 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:22:52,383 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:22:52,383 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:22:52,383 INFO ]: Start difference. First operand 61 states and 185 transitions. Second operand 12 states. [2018-06-22 11:22:52,869 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:52,869 INFO ]: Finished difference Result 91 states and 333 transitions. [2018-06-22 11:22:52,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:22:52,869 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:22:52,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:52,870 INFO ]: With dead ends: 91 [2018-06-22 11:22:52,870 INFO ]: Without dead ends: 91 [2018-06-22 11:22:52,871 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:22:52,871 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 11:22:52,882 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 63. [2018-06-22 11:22:52,882 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:22:52,883 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 188 transitions. [2018-06-22 11:22:52,883 INFO ]: Start accepts. Automaton has 63 states and 188 transitions. Word has length 17 [2018-06-22 11:22:52,883 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:52,883 INFO ]: Abstraction has 63 states and 188 transitions. [2018-06-22 11:22:52,883 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:22:52,883 INFO ]: Start isEmpty. Operand 63 states and 188 transitions. [2018-06-22 11:22:52,884 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:52,884 INFO ]: Found error trace [2018-06-22 11:22:52,884 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:52,884 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:52,884 INFO ]: Analyzing trace with hash 1711537959, now seen corresponding path program 1 times [2018-06-22 11:22:52,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:52,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:52,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:52,884 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:52,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:52,893 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:52,973 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:52,973 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:52,973 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:22:52,979 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:52,989 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:52,990 INFO ]: Computing forward predicates... [2018-06-22 11:22:53,088 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:53,107 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:53,107 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:22:53,107 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:22:53,107 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:22:53,107 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:22:53,107 INFO ]: Start difference. First operand 63 states and 188 transitions. Second operand 10 states. [2018-06-22 11:22:53,727 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:53,727 INFO ]: Finished difference Result 93 states and 338 transitions. [2018-06-22 11:22:53,727 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:22:53,727 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:22:53,727 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:53,728 INFO ]: With dead ends: 93 [2018-06-22 11:22:53,729 INFO ]: Without dead ends: 93 [2018-06-22 11:22:53,729 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:22:53,729 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:22:53,742 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 71. [2018-06-22 11:22:53,742 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 11:22:53,743 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 225 transitions. [2018-06-22 11:22:53,743 INFO ]: Start accepts. Automaton has 71 states and 225 transitions. Word has length 17 [2018-06-22 11:22:53,743 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:53,743 INFO ]: Abstraction has 71 states and 225 transitions. [2018-06-22 11:22:53,743 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:22:53,744 INFO ]: Start isEmpty. Operand 71 states and 225 transitions. [2018-06-22 11:22:53,745 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:53,745 INFO ]: Found error trace [2018-06-22 11:22:53,745 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:53,746 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:53,746 INFO ]: Analyzing trace with hash -1589229861, now seen corresponding path program 1 times [2018-06-22 11:22:53,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:53,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:53,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:53,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:53,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:53,751 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:53,857 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:22:53,857 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:53,857 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:53,871 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:53,890 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:53,892 INFO ]: Computing forward predicates... [2018-06-22 11:22:53,945 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:22:53,963 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:53,963 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:22:53,964 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:22:53,964 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:22:53,964 INFO ]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:22:53,964 INFO ]: Start difference. First operand 71 states and 225 transitions. Second operand 10 states. [2018-06-22 11:22:54,133 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:54,133 INFO ]: Finished difference Result 85 states and 296 transitions. [2018-06-22 11:22:54,133 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:22:54,133 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:22:54,133 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:54,135 INFO ]: With dead ends: 85 [2018-06-22 11:22:54,135 INFO ]: Without dead ends: 85 [2018-06-22 11:22:54,135 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:22:54,135 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 11:22:54,145 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-06-22 11:22:54,146 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:22:54,147 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 244 transitions. [2018-06-22 11:22:54,147 INFO ]: Start accepts. Automaton has 75 states and 244 transitions. Word has length 17 [2018-06-22 11:22:54,147 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:54,147 INFO ]: Abstraction has 75 states and 244 transitions. [2018-06-22 11:22:54,147 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:22:54,147 INFO ]: Start isEmpty. Operand 75 states and 244 transitions. [2018-06-22 11:22:54,149 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:54,149 INFO ]: Found error trace [2018-06-22 11:22:54,149 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:54,149 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:54,149 INFO ]: Analyzing trace with hash 2123649516, now seen corresponding path program 1 times [2018-06-22 11:22:54,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:54,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:54,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:54,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:54,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:54,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:54,206 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:22:54,206 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:54,206 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:22:54,212 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:54,239 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:54,240 INFO ]: Computing forward predicates... [2018-06-22 11:22:54,319 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:22:54,338 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:54,338 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-22 11:22:54,338 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:22:54,338 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:22:54,338 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:22:54,338 INFO ]: Start difference. First operand 75 states and 244 transitions. Second operand 12 states. [2018-06-22 11:22:54,686 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:54,686 INFO ]: Finished difference Result 107 states and 392 transitions. [2018-06-22 11:22:54,687 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:22:54,687 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:22:54,687 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:54,689 INFO ]: With dead ends: 107 [2018-06-22 11:22:54,689 INFO ]: Without dead ends: 107 [2018-06-22 11:22:54,689 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:22:54,689 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 11:22:54,706 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-06-22 11:22:54,706 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:22:54,707 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 244 transitions. [2018-06-22 11:22:54,707 INFO ]: Start accepts. Automaton has 75 states and 244 transitions. Word has length 17 [2018-06-22 11:22:54,707 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:54,707 INFO ]: Abstraction has 75 states and 244 transitions. [2018-06-22 11:22:54,707 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:22:54,707 INFO ]: Start isEmpty. Operand 75 states and 244 transitions. [2018-06-22 11:22:54,710 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:54,710 INFO ]: Found error trace [2018-06-22 11:22:54,710 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:54,710 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:54,710 INFO ]: Analyzing trace with hash 1427682521, now seen corresponding path program 1 times [2018-06-22 11:22:54,710 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:54,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:54,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:54,711 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:54,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:54,716 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:54,850 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:22:54,850 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:22:54,850 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:22:54,850 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:22:54,850 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:22:54,850 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:22:54,850 INFO ]: Start difference. First operand 75 states and 244 transitions. Second operand 4 states. [2018-06-22 11:22:55,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:55,616 INFO ]: Finished difference Result 87 states and 282 transitions. [2018-06-22 11:22:55,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:22:55,616 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:22:55,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:55,617 INFO ]: With dead ends: 87 [2018-06-22 11:22:55,617 INFO ]: Without dead ends: 87 [2018-06-22 11:22:55,617 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:22:55,617 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 11:22:55,625 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-06-22 11:22:55,625 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 11:22:55,626 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 268 transitions. [2018-06-22 11:22:55,626 INFO ]: Start accepts. Automaton has 83 states and 268 transitions. Word has length 17 [2018-06-22 11:22:55,627 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:55,627 INFO ]: Abstraction has 83 states and 268 transitions. [2018-06-22 11:22:55,627 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:22:55,627 INFO ]: Start isEmpty. Operand 83 states and 268 transitions. [2018-06-22 11:22:55,631 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:22:55,631 INFO ]: Found error trace [2018-06-22 11:22:55,631 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:55,631 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:55,631 INFO ]: Analyzing trace with hash -474798833, now seen corresponding path program 1 times [2018-06-22 11:22:55,631 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:55,631 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:55,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:55,632 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:55,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:55,636 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:55,709 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:22:55,710 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:55,710 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:22:55,716 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:55,739 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:55,740 INFO ]: Computing forward predicates... [2018-06-22 11:22:55,809 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:22:55,827 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:55,827 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:22:55,828 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:22:55,828 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:22:55,828 INFO ]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:22:55,828 INFO ]: Start difference. First operand 83 states and 268 transitions. Second operand 10 states. [2018-06-22 11:22:56,155 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:56,156 INFO ]: Finished difference Result 97 states and 338 transitions. [2018-06-22 11:22:56,156 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:22:56,156 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:22:56,156 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:56,157 INFO ]: With dead ends: 97 [2018-06-22 11:22:56,157 INFO ]: Without dead ends: 97 [2018-06-22 11:22:56,158 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:22:56,158 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 11:22:56,171 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 81. [2018-06-22 11:22:56,171 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 11:22:56,172 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 256 transitions. [2018-06-22 11:22:56,172 INFO ]: Start accepts. Automaton has 81 states and 256 transitions. Word has length 17 [2018-06-22 11:22:56,172 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:56,172 INFO ]: Abstraction has 81 states and 256 transitions. [2018-06-22 11:22:56,172 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:22:56,172 INFO ]: Start isEmpty. Operand 81 states and 256 transitions. [2018-06-22 11:22:56,174 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:22:56,174 INFO ]: Found error trace [2018-06-22 11:22:56,174 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:56,174 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:56,174 INFO ]: Analyzing trace with hash 829480137, now seen corresponding path program 2 times [2018-06-22 11:22:56,175 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:56,175 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:56,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:56,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:56,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:56,187 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:56,526 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:56,526 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:56,526 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:22:56,532 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:22:56,567 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:22:56,567 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:56,569 INFO ]: Computing forward predicates... [2018-06-22 11:22:56,680 INFO ]: Checked inductivity of 19 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:56,711 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:56,711 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-22 11:22:56,711 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:22:56,711 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:22:56,711 INFO ]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:22:56,711 INFO ]: Start difference. First operand 81 states and 256 transitions. Second operand 14 states. [2018-06-22 11:22:57,187 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:57,187 INFO ]: Finished difference Result 107 states and 388 transitions. [2018-06-22 11:22:57,187 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:22:57,187 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:22:57,187 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:57,189 INFO ]: With dead ends: 107 [2018-06-22 11:22:57,189 INFO ]: Without dead ends: 107 [2018-06-22 11:22:57,189 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:22:57,189 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 11:22:57,204 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 81. [2018-06-22 11:22:57,204 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 11:22:57,205 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 256 transitions. [2018-06-22 11:22:57,205 INFO ]: Start accepts. Automaton has 81 states and 256 transitions. Word has length 21 [2018-06-22 11:22:57,205 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:57,205 INFO ]: Abstraction has 81 states and 256 transitions. [2018-06-22 11:22:57,205 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:22:57,205 INFO ]: Start isEmpty. Operand 81 states and 256 transitions. [2018-06-22 11:22:57,207 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:22:57,207 INFO ]: Found error trace [2018-06-22 11:22:57,207 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:57,207 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:57,207 INFO ]: Analyzing trace with hash -1286915168, now seen corresponding path program 1 times [2018-06-22 11:22:57,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:57,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:57,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:57,208 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:57,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:57,214 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:57,270 INFO ]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:22:57,270 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:22:57,270 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:22:57,270 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:22:57,270 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:22:57,270 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:22:57,270 INFO ]: Start difference. First operand 81 states and 256 transitions. Second operand 4 states. [2018-06-22 11:22:57,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:57,317 INFO ]: Finished difference Result 81 states and 246 transitions. [2018-06-22 11:22:57,318 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:22:57,318 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:22:57,318 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:57,320 INFO ]: With dead ends: 81 [2018-06-22 11:22:57,320 INFO ]: Without dead ends: 69 [2018-06-22 11:22:57,320 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:22:57,320 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:22:57,336 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-06-22 11:22:57,336 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:22:57,337 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 173 transitions. [2018-06-22 11:22:57,337 INFO ]: Start accepts. Automaton has 69 states and 173 transitions. Word has length 21 [2018-06-22 11:22:57,337 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:57,337 INFO ]: Abstraction has 69 states and 173 transitions. [2018-06-22 11:22:57,337 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:22:57,337 INFO ]: Start isEmpty. Operand 69 states and 173 transitions. [2018-06-22 11:22:57,338 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:22:57,338 INFO ]: Found error trace [2018-06-22 11:22:57,338 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:57,338 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:57,338 INFO ]: Analyzing trace with hash -647802598, now seen corresponding path program 3 times [2018-06-22 11:22:57,339 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:57,339 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:57,339 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:57,339 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:22:57,339 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:57,348 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:57,911 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:57,911 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:22:57,911 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:22:57,916 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:22:57,928 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:22:57,928 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:22:57,929 INFO ]: Computing forward predicates... [2018-06-22 11:22:58,056 INFO ]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:22:58,075 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:22:58,075 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 11:22:58,075 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:22:58,075 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:22:58,075 INFO ]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:22:58,076 INFO ]: Start difference. First operand 69 states and 173 transitions. Second operand 18 states. [2018-06-22 11:22:59,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:22:59,918 INFO ]: Finished difference Result 147 states and 449 transitions. [2018-06-22 11:22:59,921 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:22:59,921 INFO ]: Start accepts. Automaton has 18 states. Word has length 21 [2018-06-22 11:22:59,921 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:22:59,922 INFO ]: With dead ends: 147 [2018-06-22 11:22:59,922 INFO ]: Without dead ends: 147 [2018-06-22 11:22:59,923 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=1573, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:22:59,923 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-22 11:22:59,939 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 89. [2018-06-22 11:22:59,939 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-22 11:22:59,940 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 245 transitions. [2018-06-22 11:22:59,940 INFO ]: Start accepts. Automaton has 89 states and 245 transitions. Word has length 21 [2018-06-22 11:22:59,941 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:22:59,941 INFO ]: Abstraction has 89 states and 245 transitions. [2018-06-22 11:22:59,941 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:22:59,941 INFO ]: Start isEmpty. Operand 89 states and 245 transitions. [2018-06-22 11:22:59,942 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:22:59,942 INFO ]: Found error trace [2018-06-22 11:22:59,942 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:22:59,942 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:22:59,942 INFO ]: Analyzing trace with hash 2017683997, now seen corresponding path program 1 times [2018-06-22 11:22:59,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:22:59,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:22:59,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:59,944 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:22:59,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:22:59,950 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:00,006 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:23:00,006 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:00,006 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:23:00,012 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:00,023 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:00,025 INFO ]: Computing forward predicates... [2018-06-22 11:23:00,080 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:23:00,099 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:00,099 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-22 11:23:00,099 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:23:00,099 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:23:00,099 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:23:00,099 INFO ]: Start difference. First operand 89 states and 245 transitions. Second operand 12 states. [2018-06-22 11:23:00,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:00,425 INFO ]: Finished difference Result 117 states and 346 transitions. [2018-06-22 11:23:00,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:23:00,426 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 11:23:00,426 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:00,427 INFO ]: With dead ends: 117 [2018-06-22 11:23:00,427 INFO ]: Without dead ends: 117 [2018-06-22 11:23:00,428 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:23:00,428 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 11:23:00,441 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 85. [2018-06-22 11:23:00,441 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-22 11:23:00,442 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 231 transitions. [2018-06-22 11:23:00,442 INFO ]: Start accepts. Automaton has 85 states and 231 transitions. Word has length 21 [2018-06-22 11:23:00,443 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:00,443 INFO ]: Abstraction has 85 states and 231 transitions. [2018-06-22 11:23:00,443 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:23:00,443 INFO ]: Start isEmpty. Operand 85 states and 231 transitions. [2018-06-22 11:23:00,444 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:23:00,444 INFO ]: Found error trace [2018-06-22 11:23:00,444 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:00,444 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:00,444 INFO ]: Analyzing trace with hash -1236541620, now seen corresponding path program 2 times [2018-06-22 11:23:00,444 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:00,444 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:00,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:00,445 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:00,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:00,452 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:00,543 INFO ]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:23:00,543 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:00,543 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:23:00,550 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:23:00,577 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:23:00,577 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:00,579 INFO ]: Computing forward predicates... [2018-06-22 11:23:00,812 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:23:00,831 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:00,831 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:23:00,831 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:23:00,831 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:23:00,831 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:23:00,831 INFO ]: Start difference. First operand 85 states and 231 transitions. Second operand 16 states. [2018-06-22 11:23:01,489 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:01,489 INFO ]: Finished difference Result 117 states and 342 transitions. [2018-06-22 11:23:01,489 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:23:01,489 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:23:01,489 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:01,490 INFO ]: With dead ends: 117 [2018-06-22 11:23:01,490 INFO ]: Without dead ends: 117 [2018-06-22 11:23:01,491 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:23:01,491 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 11:23:01,503 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 87. [2018-06-22 11:23:01,503 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 11:23:01,504 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 234 transitions. [2018-06-22 11:23:01,504 INFO ]: Start accepts. Automaton has 87 states and 234 transitions. Word has length 21 [2018-06-22 11:23:01,504 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:01,504 INFO ]: Abstraction has 87 states and 234 transitions. [2018-06-22 11:23:01,504 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:23:01,504 INFO ]: Start isEmpty. Operand 87 states and 234 transitions. [2018-06-22 11:23:01,506 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:23:01,506 INFO ]: Found error trace [2018-06-22 11:23:01,506 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:01,506 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:01,506 INFO ]: Analyzing trace with hash 948240233, now seen corresponding path program 2 times [2018-06-22 11:23:01,506 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:01,506 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:01,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:01,507 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:01,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:01,526 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:01,654 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:23:01,654 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:01,654 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:23:01,659 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:23:01,670 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:23:01,670 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:01,672 INFO ]: Computing forward predicates... [2018-06-22 11:23:01,749 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:23:01,768 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:01,768 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:23:01,768 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:23:01,768 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:23:01,768 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:23:01,768 INFO ]: Start difference. First operand 87 states and 234 transitions. Second operand 16 states. [2018-06-22 11:23:02,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:02,463 INFO ]: Finished difference Result 141 states and 418 transitions. [2018-06-22 11:23:02,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:23:02,463 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:23:02,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:02,465 INFO ]: With dead ends: 141 [2018-06-22 11:23:02,465 INFO ]: Without dead ends: 141 [2018-06-22 11:23:02,465 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:23:02,465 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 11:23:02,477 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 93. [2018-06-22 11:23:02,477 INFO ]: Start removeUnreachable. Operand 93 states. [2018-06-22 11:23:02,478 INFO ]: Finished removeUnreachable. Reduced from 93 states to 93 states and 250 transitions. [2018-06-22 11:23:02,478 INFO ]: Start accepts. Automaton has 93 states and 250 transitions. Word has length 21 [2018-06-22 11:23:02,478 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:02,478 INFO ]: Abstraction has 93 states and 250 transitions. [2018-06-22 11:23:02,478 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:23:02,478 INFO ]: Start isEmpty. Operand 93 states and 250 transitions. [2018-06-22 11:23:02,480 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:23:02,480 INFO ]: Found error trace [2018-06-22 11:23:02,480 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:02,480 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:02,480 INFO ]: Analyzing trace with hash -977242152, now seen corresponding path program 1 times [2018-06-22 11:23:02,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:02,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:02,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:02,480 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:02,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:02,486 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:02,713 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:23:02,713 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:02,713 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:23:02,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:02,729 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:02,730 INFO ]: Computing forward predicates... [2018-06-22 11:23:02,827 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:23:02,846 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:02,846 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:23:02,846 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:23:02,846 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:23:02,846 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:23:02,846 INFO ]: Start difference. First operand 93 states and 250 transitions. Second operand 14 states. [2018-06-22 11:23:03,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:03,491 INFO ]: Finished difference Result 175 states and 537 transitions. [2018-06-22 11:23:03,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:23:03,494 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:23:03,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:03,496 INFO ]: With dead ends: 175 [2018-06-22 11:23:03,496 INFO ]: Without dead ends: 175 [2018-06-22 11:23:03,497 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:23:03,497 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-22 11:23:03,513 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 119. [2018-06-22 11:23:03,513 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-22 11:23:03,515 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 347 transitions. [2018-06-22 11:23:03,515 INFO ]: Start accepts. Automaton has 119 states and 347 transitions. Word has length 21 [2018-06-22 11:23:03,515 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:03,515 INFO ]: Abstraction has 119 states and 347 transitions. [2018-06-22 11:23:03,515 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:23:03,515 INFO ]: Start isEmpty. Operand 119 states and 347 transitions. [2018-06-22 11:23:03,516 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:23:03,516 INFO ]: Found error trace [2018-06-22 11:23:03,516 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:03,516 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:03,517 INFO ]: Analyzing trace with hash -1660369714, now seen corresponding path program 1 times [2018-06-22 11:23:03,517 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:03,517 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:03,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:03,517 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:03,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:03,521 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:03,694 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:23:03,694 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:03,694 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:23:03,700 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:03,710 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:03,711 INFO ]: Computing forward predicates... [2018-06-22 11:23:03,901 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:23:03,920 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:03,920 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-22 11:23:03,920 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:23:03,920 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:23:03,920 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:23:03,921 INFO ]: Start difference. First operand 119 states and 347 transitions. Second operand 16 states. [2018-06-22 11:23:04,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:04,992 INFO ]: Finished difference Result 167 states and 509 transitions. [2018-06-22 11:23:04,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:23:04,992 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:23:04,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:04,994 INFO ]: With dead ends: 167 [2018-06-22 11:23:04,994 INFO ]: Without dead ends: 167 [2018-06-22 11:23:04,995 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:23:04,995 INFO ]: Start minimizeSevpa. Operand 167 states. [2018-06-22 11:23:05,010 INFO ]: Finished minimizeSevpa. Reduced states from 167 to 115. [2018-06-22 11:23:05,010 INFO ]: Start removeUnreachable. Operand 115 states. [2018-06-22 11:23:05,012 INFO ]: Finished removeUnreachable. Reduced from 115 states to 115 states and 338 transitions. [2018-06-22 11:23:05,012 INFO ]: Start accepts. Automaton has 115 states and 338 transitions. Word has length 21 [2018-06-22 11:23:05,012 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:05,012 INFO ]: Abstraction has 115 states and 338 transitions. [2018-06-22 11:23:05,012 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:23:05,012 INFO ]: Start isEmpty. Operand 115 states and 338 transitions. [2018-06-22 11:23:05,015 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:05,016 INFO ]: Found error trace [2018-06-22 11:23:05,016 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:05,016 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:05,016 INFO ]: Analyzing trace with hash 673087029, now seen corresponding path program 1 times [2018-06-22 11:23:05,016 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:05,016 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:05,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:05,016 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:05,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:05,022 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:05,087 INFO ]: Checked inductivity of 31 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:23:05,087 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:05,087 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:23:05,094 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:05,108 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:05,109 INFO ]: Computing forward predicates... [2018-06-22 11:23:05,192 INFO ]: Checked inductivity of 31 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:05,212 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:05,212 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 14 [2018-06-22 11:23:05,212 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:23:05,212 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:23:05,212 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:23:05,212 INFO ]: Start difference. First operand 115 states and 338 transitions. Second operand 14 states. [2018-06-22 11:23:05,722 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:05,722 INFO ]: Finished difference Result 197 states and 625 transitions. [2018-06-22 11:23:05,722 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:23:05,722 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:23:05,722 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:05,724 INFO ]: With dead ends: 197 [2018-06-22 11:23:05,724 INFO ]: Without dead ends: 197 [2018-06-22 11:23:05,724 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:23:05,724 INFO ]: Start minimizeSevpa. Operand 197 states. [2018-06-22 11:23:05,746 INFO ]: Finished minimizeSevpa. Reduced states from 197 to 167. [2018-06-22 11:23:05,747 INFO ]: Start removeUnreachable. Operand 167 states. [2018-06-22 11:23:05,748 INFO ]: Finished removeUnreachable. Reduced from 167 states to 167 states and 518 transitions. [2018-06-22 11:23:05,749 INFO ]: Start accepts. Automaton has 167 states and 518 transitions. Word has length 25 [2018-06-22 11:23:05,749 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:05,749 INFO ]: Abstraction has 167 states and 518 transitions. [2018-06-22 11:23:05,749 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:23:05,749 INFO ]: Start isEmpty. Operand 167 states and 518 transitions. [2018-06-22 11:23:05,751 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:05,751 INFO ]: Found error trace [2018-06-22 11:23:05,751 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:05,751 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:05,751 INFO ]: Analyzing trace with hash -940118175, now seen corresponding path program 1 times [2018-06-22 11:23:05,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:05,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:05,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:05,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:05,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:05,757 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:06,421 INFO ]: Checked inductivity of 33 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:23:06,421 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:06,421 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) [2018-06-22 11:23:06,434 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:06,466 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:06,468 INFO ]: Computing forward predicates... [2018-06-22 11:23:06,945 INFO ]: Checked inductivity of 33 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:23:06,964 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:06,964 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:23:06,964 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:23:06,964 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:23:06,964 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:23:06,964 INFO ]: Start difference. First operand 167 states and 518 transitions. Second operand 14 states. [2018-06-22 11:23:08,092 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:08,092 INFO ]: Finished difference Result 195 states and 603 transitions. [2018-06-22 11:23:08,092 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:23:08,092 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:23:08,092 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:08,094 INFO ]: With dead ends: 195 [2018-06-22 11:23:08,094 INFO ]: Without dead ends: 195 [2018-06-22 11:23:08,094 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:23:08,094 INFO ]: Start minimizeSevpa. Operand 195 states. [2018-06-22 11:23:08,112 INFO ]: Finished minimizeSevpa. Reduced states from 195 to 175. [2018-06-22 11:23:08,112 INFO ]: Start removeUnreachable. Operand 175 states. [2018-06-22 11:23:08,114 INFO ]: Finished removeUnreachable. Reduced from 175 states to 175 states and 541 transitions. [2018-06-22 11:23:08,114 INFO ]: Start accepts. Automaton has 175 states and 541 transitions. Word has length 25 [2018-06-22 11:23:08,115 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:08,115 INFO ]: Abstraction has 175 states and 541 transitions. [2018-06-22 11:23:08,115 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:23:08,115 INFO ]: Start isEmpty. Operand 175 states and 541 transitions. [2018-06-22 11:23:08,116 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:08,116 INFO ]: Found error trace [2018-06-22 11:23:08,116 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:08,117 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:08,117 INFO ]: Analyzing trace with hash 2117628136, now seen corresponding path program 3 times [2018-06-22 11:23:08,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:08,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:08,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:08,117 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:08,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:08,126 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:08,317 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:08,318 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:08,318 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:23:08,326 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:23:08,341 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:23:08,341 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:08,342 INFO ]: Computing forward predicates... [2018-06-22 11:23:08,529 INFO ]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:08,548 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:08,548 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 11:23:08,548 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:23:08,548 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:23:08,548 INFO ]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:23:08,548 INFO ]: Start difference. First operand 175 states and 541 transitions. Second operand 22 states. [2018-06-22 11:23:09,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:09,833 INFO ]: Finished difference Result 229 states and 715 transitions. [2018-06-22 11:23:09,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:23:09,834 INFO ]: Start accepts. Automaton has 22 states. Word has length 25 [2018-06-22 11:23:09,834 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:09,835 INFO ]: With dead ends: 229 [2018-06-22 11:23:09,835 INFO ]: Without dead ends: 229 [2018-06-22 11:23:09,836 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=1491, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:23:09,836 INFO ]: Start minimizeSevpa. Operand 229 states. [2018-06-22 11:23:09,858 INFO ]: Finished minimizeSevpa. Reduced states from 229 to 179. [2018-06-22 11:23:09,858 INFO ]: Start removeUnreachable. Operand 179 states. [2018-06-22 11:23:09,860 INFO ]: Finished removeUnreachable. Reduced from 179 states to 179 states and 556 transitions. [2018-06-22 11:23:09,861 INFO ]: Start accepts. Automaton has 179 states and 556 transitions. Word has length 25 [2018-06-22 11:23:09,861 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:09,861 INFO ]: Abstraction has 179 states and 556 transitions. [2018-06-22 11:23:09,861 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:23:09,861 INFO ]: Start isEmpty. Operand 179 states and 556 transitions. [2018-06-22 11:23:09,863 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:09,863 INFO ]: Found error trace [2018-06-22 11:23:09,863 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:09,863 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:09,863 INFO ]: Analyzing trace with hash -1435006569, now seen corresponding path program 4 times [2018-06-22 11:23:09,863 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:09,863 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:09,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:09,864 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:09,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:09,872 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:10,915 INFO ]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:10,915 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:10,915 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:23:10,920 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:23:10,937 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:23:10,937 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:10,938 INFO ]: Computing forward predicates... [2018-06-22 11:23:11,048 INFO ]: Checked inductivity of 33 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:23:11,070 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:11,070 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-06-22 11:23:11,071 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:23:11,071 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:23:11,071 INFO ]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:23:11,071 INFO ]: Start difference. First operand 179 states and 556 transitions. Second operand 18 states. [2018-06-22 11:23:12,781 WARN ]: Spent 305.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-06-22 11:23:14,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:14,041 INFO ]: Finished difference Result 387 states and 1267 transitions. [2018-06-22 11:23:14,041 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 11:23:14,041 INFO ]: Start accepts. Automaton has 18 states. Word has length 25 [2018-06-22 11:23:14,041 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:14,044 INFO ]: With dead ends: 387 [2018-06-22 11:23:14,044 INFO ]: Without dead ends: 387 [2018-06-22 11:23:14,045 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=621, Invalid=3039, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 11:23:14,045 INFO ]: Start minimizeSevpa. Operand 387 states. [2018-06-22 11:23:14,072 INFO ]: Finished minimizeSevpa. Reduced states from 387 to 243. [2018-06-22 11:23:14,072 INFO ]: Start removeUnreachable. Operand 243 states. [2018-06-22 11:23:14,074 INFO ]: Finished removeUnreachable. Reduced from 243 states to 243 states and 774 transitions. [2018-06-22 11:23:14,075 INFO ]: Start accepts. Automaton has 243 states and 774 transitions. Word has length 25 [2018-06-22 11:23:14,075 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:14,075 INFO ]: Abstraction has 243 states and 774 transitions. [2018-06-22 11:23:14,075 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:23:14,075 INFO ]: Start isEmpty. Operand 243 states and 774 transitions. [2018-06-22 11:23:14,078 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:14,078 INFO ]: Found error trace [2018-06-22 11:23:14,078 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:14,078 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:14,079 INFO ]: Analyzing trace with hash 1351527157, now seen corresponding path program 5 times [2018-06-22 11:23:14,079 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:14,079 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:14,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:14,079 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:14,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:14,086 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:14,325 INFO ]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:14,325 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:14,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:23:14,332 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:23:14,347 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 11:23:14,347 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:14,349 INFO ]: Computing forward predicates... [2018-06-22 11:23:14,440 INFO ]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:23:14,471 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:14,471 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-06-22 11:23:14,472 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:23:14,472 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:23:14,472 INFO ]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:23:14,472 INFO ]: Start difference. First operand 243 states and 774 transitions. Second operand 17 states. [2018-06-22 11:23:15,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:15,132 INFO ]: Finished difference Result 363 states and 1184 transitions. [2018-06-22 11:23:15,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:23:15,132 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-22 11:23:15,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:15,135 INFO ]: With dead ends: 363 [2018-06-22 11:23:15,135 INFO ]: Without dead ends: 363 [2018-06-22 11:23:15,137 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:23:15,137 INFO ]: Start minimizeSevpa. Operand 363 states. [2018-06-22 11:23:15,175 INFO ]: Finished minimizeSevpa. Reduced states from 363 to 255. [2018-06-22 11:23:15,175 INFO ]: Start removeUnreachable. Operand 255 states. [2018-06-22 11:23:15,178 INFO ]: Finished removeUnreachable. Reduced from 255 states to 255 states and 814 transitions. [2018-06-22 11:23:15,178 INFO ]: Start accepts. Automaton has 255 states and 814 transitions. Word has length 25 [2018-06-22 11:23:15,178 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:15,178 INFO ]: Abstraction has 255 states and 814 transitions. [2018-06-22 11:23:15,178 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:23:15,178 INFO ]: Start isEmpty. Operand 255 states and 814 transitions. [2018-06-22 11:23:15,181 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:15,181 INFO ]: Found error trace [2018-06-22 11:23:15,181 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:15,181 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:15,181 INFO ]: Analyzing trace with hash -235640907, now seen corresponding path program 6 times [2018-06-22 11:23:15,181 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:15,181 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:15,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:15,181 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:15,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:15,189 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:15,530 INFO ]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:15,530 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:15,530 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) [2018-06-22 11:23:15,544 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:15,564 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:23:15,565 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:15,566 INFO ]: Computing forward predicates... [2018-06-22 11:23:15,773 INFO ]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:15,797 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:15,797 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 11:23:15,797 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:23:15,797 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:23:15,797 INFO ]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:23:15,797 INFO ]: Start difference. First operand 255 states and 814 transitions. Second operand 22 states. [2018-06-22 11:23:17,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:17,689 INFO ]: Finished difference Result 385 states and 1269 transitions. [2018-06-22 11:23:17,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 11:23:17,689 INFO ]: Start accepts. Automaton has 22 states. Word has length 25 [2018-06-22 11:23:17,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:17,692 INFO ]: With dead ends: 385 [2018-06-22 11:23:17,692 INFO ]: Without dead ends: 385 [2018-06-22 11:23:17,692 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=409, Invalid=2783, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:23:17,693 INFO ]: Start minimizeSevpa. Operand 385 states. [2018-06-22 11:23:17,732 INFO ]: Finished minimizeSevpa. Reduced states from 385 to 277. [2018-06-22 11:23:17,732 INFO ]: Start removeUnreachable. Operand 277 states. [2018-06-22 11:23:17,734 INFO ]: Finished removeUnreachable. Reduced from 277 states to 277 states and 890 transitions. [2018-06-22 11:23:17,734 INFO ]: Start accepts. Automaton has 277 states and 890 transitions. Word has length 25 [2018-06-22 11:23:17,734 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:17,734 INFO ]: Abstraction has 277 states and 890 transitions. [2018-06-22 11:23:17,735 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:23:17,735 INFO ]: Start isEmpty. Operand 277 states and 890 transitions. [2018-06-22 11:23:17,737 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:17,737 INFO ]: Found error trace [2018-06-22 11:23:17,737 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:17,738 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:17,738 INFO ]: Analyzing trace with hash -1552599947, now seen corresponding path program 7 times [2018-06-22 11:23:17,738 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:17,738 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:17,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:17,739 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:17,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:17,745 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:17,893 INFO ]: Checked inductivity of 33 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:23:17,893 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:17,893 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:23:17,901 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:17,914 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:17,915 INFO ]: Computing forward predicates... [2018-06-22 11:23:18,069 INFO ]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:18,087 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:18,087 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-06-22 11:23:18,088 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:23:18,088 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:23:18,088 INFO ]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:23:18,088 INFO ]: Start difference. First operand 277 states and 890 transitions. Second operand 21 states. [2018-06-22 11:23:18,231 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-06-22 11:23:19,768 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:19,768 INFO ]: Finished difference Result 393 states and 1300 transitions. [2018-06-22 11:23:19,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 11:23:19,768 INFO ]: Start accepts. Automaton has 21 states. Word has length 25 [2018-06-22 11:23:19,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:19,771 INFO ]: With dead ends: 393 [2018-06-22 11:23:19,771 INFO ]: Without dead ends: 393 [2018-06-22 11:23:19,771 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=408, Invalid=2562, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 11:23:19,772 INFO ]: Start minimizeSevpa. Operand 393 states. [2018-06-22 11:23:19,792 INFO ]: Finished minimizeSevpa. Reduced states from 393 to 281. [2018-06-22 11:23:19,792 INFO ]: Start removeUnreachable. Operand 281 states. [2018-06-22 11:23:19,795 INFO ]: Finished removeUnreachable. Reduced from 281 states to 281 states and 911 transitions. [2018-06-22 11:23:19,795 INFO ]: Start accepts. Automaton has 281 states and 911 transitions. Word has length 25 [2018-06-22 11:23:19,795 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:19,795 INFO ]: Abstraction has 281 states and 911 transitions. [2018-06-22 11:23:19,795 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:23:19,795 INFO ]: Start isEmpty. Operand 281 states and 911 transitions. [2018-06-22 11:23:19,798 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:19,798 INFO ]: Found error trace [2018-06-22 11:23:19,798 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:19,798 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:19,798 INFO ]: Analyzing trace with hash -871131949, now seen corresponding path program 1 times [2018-06-22 11:23:19,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:19,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:19,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:19,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:19,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:19,806 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:19,855 INFO ]: Checked inductivity of 31 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:23:19,855 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:19,855 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:23:19,861 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:19,874 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:19,875 INFO ]: Computing forward predicates... [2018-06-22 11:23:19,971 INFO ]: Checked inductivity of 31 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:23:19,991 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:19,991 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:23:19,991 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:23:19,991 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:23:19,991 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:23:19,991 INFO ]: Start difference. First operand 281 states and 911 transitions. Second operand 14 states. [2018-06-22 11:23:20,573 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:20,573 INFO ]: Finished difference Result 283 states and 903 transitions. [2018-06-22 11:23:20,573 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:23:20,573 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:23:20,573 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:20,575 INFO ]: With dead ends: 283 [2018-06-22 11:23:20,575 INFO ]: Without dead ends: 283 [2018-06-22 11:23:20,575 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:23:20,575 INFO ]: Start minimizeSevpa. Operand 283 states. [2018-06-22 11:23:20,596 INFO ]: Finished minimizeSevpa. Reduced states from 283 to 235. [2018-06-22 11:23:20,596 INFO ]: Start removeUnreachable. Operand 235 states. [2018-06-22 11:23:20,598 INFO ]: Finished removeUnreachable. Reduced from 235 states to 235 states and 734 transitions. [2018-06-22 11:23:20,598 INFO ]: Start accepts. Automaton has 235 states and 734 transitions. Word has length 25 [2018-06-22 11:23:20,598 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:20,598 INFO ]: Abstraction has 235 states and 734 transitions. [2018-06-22 11:23:20,599 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:23:20,599 INFO ]: Start isEmpty. Operand 235 states and 734 transitions. [2018-06-22 11:23:20,601 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:20,601 INFO ]: Found error trace [2018-06-22 11:23:20,601 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:20,601 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:20,601 INFO ]: Analyzing trace with hash -810267356, now seen corresponding path program 3 times [2018-06-22 11:23:20,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:20,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:20,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:20,601 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:20,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:20,607 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:20,782 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:23:20,983 WARN ]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 11:23:21,180 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:21,180 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:21,180 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:23:21,187 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:23:21,203 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:23:21,203 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:21,205 INFO ]: Computing forward predicates... [2018-06-22 11:23:21,368 INFO ]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:23:21,386 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:21,386 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-06-22 11:23:21,387 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:23:21,387 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:23:21,387 INFO ]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:23:21,387 INFO ]: Start difference. First operand 235 states and 734 transitions. Second operand 20 states. [2018-06-22 11:23:22,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:22,287 INFO ]: Finished difference Result 277 states and 881 transitions. [2018-06-22 11:23:22,290 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:23:22,290 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 11:23:22,290 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:22,293 INFO ]: With dead ends: 277 [2018-06-22 11:23:22,293 INFO ]: Without dead ends: 277 [2018-06-22 11:23:22,293 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:23:22,293 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-22 11:23:22,316 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 239. [2018-06-22 11:23:22,316 INFO ]: Start removeUnreachable. Operand 239 states. [2018-06-22 11:23:22,323 INFO ]: Finished removeUnreachable. Reduced from 239 states to 239 states and 747 transitions. [2018-06-22 11:23:22,323 INFO ]: Start accepts. Automaton has 239 states and 747 transitions. Word has length 25 [2018-06-22 11:23:22,324 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:22,324 INFO ]: Abstraction has 239 states and 747 transitions. [2018-06-22 11:23:22,324 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:23:22,324 INFO ]: Start isEmpty. Operand 239 states and 747 transitions. [2018-06-22 11:23:22,327 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:22,327 INFO ]: Found error trace [2018-06-22 11:23:22,327 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:22,327 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:22,327 INFO ]: Analyzing trace with hash -623687752, now seen corresponding path program 3 times [2018-06-22 11:23:22,327 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:22,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:22,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:22,327 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:22,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:22,332 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:22,422 INFO ]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:22,422 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:22,422 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:23:22,428 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:23:22,446 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:23:22,446 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:22,447 INFO ]: Computing forward predicates... [2018-06-22 11:23:23,108 INFO ]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:23:23,137 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:23,137 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-06-22 11:23:23,137 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:23:23,137 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:23:23,138 INFO ]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:23:23,138 INFO ]: Start difference. First operand 239 states and 747 transitions. Second operand 20 states. [2018-06-22 11:23:24,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:24,309 INFO ]: Finished difference Result 273 states and 865 transitions. [2018-06-22 11:23:24,309 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:23:24,309 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 11:23:24,310 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:24,311 INFO ]: With dead ends: 273 [2018-06-22 11:23:24,311 INFO ]: Without dead ends: 273 [2018-06-22 11:23:24,311 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:23:24,312 INFO ]: Start minimizeSevpa. Operand 273 states. [2018-06-22 11:23:24,326 INFO ]: Finished minimizeSevpa. Reduced states from 273 to 239. [2018-06-22 11:23:24,326 INFO ]: Start removeUnreachable. Operand 239 states. [2018-06-22 11:23:24,328 INFO ]: Finished removeUnreachable. Reduced from 239 states to 239 states and 743 transitions. [2018-06-22 11:23:24,328 INFO ]: Start accepts. Automaton has 239 states and 743 transitions. Word has length 25 [2018-06-22 11:23:24,328 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:24,328 INFO ]: Abstraction has 239 states and 743 transitions. [2018-06-22 11:23:24,328 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:23:24,328 INFO ]: Start isEmpty. Operand 239 states and 743 transitions. [2018-06-22 11:23:24,331 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:24,331 INFO ]: Found error trace [2018-06-22 11:23:24,331 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:24,331 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:24,331 INFO ]: Analyzing trace with hash -872184424, now seen corresponding path program 1 times [2018-06-22 11:23:24,331 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:24,331 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:24,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:24,331 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:24,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:24,336 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:24,373 INFO ]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:23:24,373 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:24,373 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:23:24,378 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:24,390 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:24,391 INFO ]: Computing forward predicates... [2018-06-22 11:23:24,498 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:23:24,517 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:24,517 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:23:24,517 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:23:24,517 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:23:24,517 INFO ]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:23:24,517 INFO ]: Start difference. First operand 239 states and 743 transitions. Second operand 16 states. [2018-06-22 11:23:25,048 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:25,048 INFO ]: Finished difference Result 281 states and 873 transitions. [2018-06-22 11:23:25,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:23:25,048 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 11:23:25,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:25,050 INFO ]: With dead ends: 281 [2018-06-22 11:23:25,050 INFO ]: Without dead ends: 281 [2018-06-22 11:23:25,050 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:23:25,050 INFO ]: Start minimizeSevpa. Operand 281 states. [2018-06-22 11:23:25,064 INFO ]: Finished minimizeSevpa. Reduced states from 281 to 237. [2018-06-22 11:23:25,064 INFO ]: Start removeUnreachable. Operand 237 states. [2018-06-22 11:23:25,066 INFO ]: Finished removeUnreachable. Reduced from 237 states to 237 states and 724 transitions. [2018-06-22 11:23:25,066 INFO ]: Start accepts. Automaton has 237 states and 724 transitions. Word has length 25 [2018-06-22 11:23:25,066 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:25,066 INFO ]: Abstraction has 237 states and 724 transitions. [2018-06-22 11:23:25,066 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:23:25,066 INFO ]: Start isEmpty. Operand 237 states and 724 transitions. [2018-06-22 11:23:25,069 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:25,069 INFO ]: Found error trace [2018-06-22 11:23:25,069 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:25,069 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:25,069 INFO ]: Analyzing trace with hash 444774616, now seen corresponding path program 2 times [2018-06-22 11:23:25,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:25,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:25,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:25,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:25,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:25,075 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:25,727 INFO ]: Checked inductivity of 18 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:23:25,727 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:25,727 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) [2018-06-22 11:23:25,738 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:25,781 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:23:25,781 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:25,783 INFO ]: Computing forward predicates... [2018-06-22 11:23:26,151 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:23:26,169 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:26,169 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 17 [2018-06-22 11:23:26,169 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:23:26,170 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:23:26,170 INFO ]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:23:26,170 INFO ]: Start difference. First operand 237 states and 724 transitions. Second operand 17 states. [2018-06-22 11:23:26,858 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:26,858 INFO ]: Finished difference Result 299 states and 822 transitions. [2018-06-22 11:23:26,858 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:23:26,858 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-22 11:23:26,858 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:26,860 INFO ]: With dead ends: 299 [2018-06-22 11:23:26,860 INFO ]: Without dead ends: 299 [2018-06-22 11:23:26,860 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:23:26,860 INFO ]: Start minimizeSevpa. Operand 299 states. [2018-06-22 11:23:26,879 INFO ]: Finished minimizeSevpa. Reduced states from 299 to 267. [2018-06-22 11:23:26,879 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-22 11:23:26,881 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 764 transitions. [2018-06-22 11:23:26,881 INFO ]: Start accepts. Automaton has 267 states and 764 transitions. Word has length 25 [2018-06-22 11:23:26,881 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:26,881 INFO ]: Abstraction has 267 states and 764 transitions. [2018-06-22 11:23:26,881 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:23:26,881 INFO ]: Start isEmpty. Operand 267 states and 764 transitions. [2018-06-22 11:23:26,884 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:26,884 INFO ]: Found error trace [2018-06-22 11:23:26,884 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:26,884 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:26,884 INFO ]: Analyzing trace with hash -1166198489, now seen corresponding path program 1 times [2018-06-22 11:23:26,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:26,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:26,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:26,884 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:26,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:26,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:27,050 INFO ]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:23:27,050 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:27,050 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:23:27,051 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:23:27,051 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:23:27,051 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:23:27,051 INFO ]: Start difference. First operand 267 states and 764 transitions. Second operand 6 states. [2018-06-22 11:23:27,155 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:27,155 INFO ]: Finished difference Result 287 states and 833 transitions. [2018-06-22 11:23:27,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:23:27,155 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 11:23:27,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:27,157 INFO ]: With dead ends: 287 [2018-06-22 11:23:27,157 INFO ]: Without dead ends: 287 [2018-06-22 11:23:27,157 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:23:27,157 INFO ]: Start minimizeSevpa. Operand 287 states. [2018-06-22 11:23:27,172 INFO ]: Finished minimizeSevpa. Reduced states from 287 to 269. [2018-06-22 11:23:27,172 INFO ]: Start removeUnreachable. Operand 269 states. [2018-06-22 11:23:27,174 INFO ]: Finished removeUnreachable. Reduced from 269 states to 269 states and 769 transitions. [2018-06-22 11:23:27,174 INFO ]: Start accepts. Automaton has 269 states and 769 transitions. Word has length 25 [2018-06-22 11:23:27,174 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:27,174 INFO ]: Abstraction has 269 states and 769 transitions. [2018-06-22 11:23:27,174 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:23:27,174 INFO ]: Start isEmpty. Operand 269 states and 769 transitions. [2018-06-22 11:23:27,176 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:27,176 INFO ]: Found error trace [2018-06-22 11:23:27,176 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:27,176 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:27,176 INFO ]: Analyzing trace with hash 1753015089, now seen corresponding path program 1 times [2018-06-22 11:23:27,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:27,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:27,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:27,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:27,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:27,181 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:27,226 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:23:27,226 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:27,226 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) [2018-06-22 11:23:27,239 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:27,268 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:27,269 INFO ]: Computing forward predicates... [2018-06-22 11:23:27,275 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:23:27,293 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:27,293 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:23:27,293 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:23:27,293 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:23:27,293 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:23:27,293 INFO ]: Start difference. First operand 269 states and 769 transitions. Second operand 9 states. [2018-06-22 11:23:27,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:27,448 INFO ]: Finished difference Result 283 states and 818 transitions. [2018-06-22 11:23:27,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:23:27,448 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 11:23:27,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:27,451 INFO ]: With dead ends: 283 [2018-06-22 11:23:27,451 INFO ]: Without dead ends: 283 [2018-06-22 11:23:27,451 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:23:27,451 INFO ]: Start minimizeSevpa. Operand 283 states. [2018-06-22 11:23:27,474 INFO ]: Finished minimizeSevpa. Reduced states from 283 to 263. [2018-06-22 11:23:27,474 INFO ]: Start removeUnreachable. Operand 263 states. [2018-06-22 11:23:27,475 INFO ]: Finished removeUnreachable. Reduced from 263 states to 263 states and 748 transitions. [2018-06-22 11:23:27,475 INFO ]: Start accepts. Automaton has 263 states and 748 transitions. Word has length 25 [2018-06-22 11:23:27,475 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:27,475 INFO ]: Abstraction has 263 states and 748 transitions. [2018-06-22 11:23:27,475 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:23:27,475 INFO ]: Start isEmpty. Operand 263 states and 748 transitions. [2018-06-22 11:23:27,477 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:23:27,477 INFO ]: Found error trace [2018-06-22 11:23:27,477 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:27,477 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:27,477 INFO ]: Analyzing trace with hash -395481360, now seen corresponding path program 1 times [2018-06-22 11:23:27,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:27,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:27,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:27,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:27,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:27,484 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:27,799 INFO ]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:23:27,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:27,799 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:27,804 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:27,816 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:27,818 INFO ]: Computing forward predicates... [2018-06-22 11:23:28,035 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:23:28,054 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:28,054 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-22 11:23:28,054 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:23:28,055 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:23:28,055 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:23:28,055 INFO ]: Start difference. First operand 263 states and 748 transitions. Second operand 15 states. [2018-06-22 11:23:28,715 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:28,715 INFO ]: Finished difference Result 315 states and 906 transitions. [2018-06-22 11:23:28,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:23:28,716 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 11:23:28,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:28,717 INFO ]: With dead ends: 315 [2018-06-22 11:23:28,717 INFO ]: Without dead ends: 315 [2018-06-22 11:23:28,718 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:23:28,718 INFO ]: Start minimizeSevpa. Operand 315 states. [2018-06-22 11:23:28,733 INFO ]: Finished minimizeSevpa. Reduced states from 315 to 263. [2018-06-22 11:23:28,733 INFO ]: Start removeUnreachable. Operand 263 states. [2018-06-22 11:23:28,734 INFO ]: Finished removeUnreachable. Reduced from 263 states to 263 states and 744 transitions. [2018-06-22 11:23:28,734 INFO ]: Start accepts. Automaton has 263 states and 744 transitions. Word has length 25 [2018-06-22 11:23:28,735 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:28,735 INFO ]: Abstraction has 263 states and 744 transitions. [2018-06-22 11:23:28,735 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:23:28,735 INFO ]: Start isEmpty. Operand 263 states and 744 transitions. [2018-06-22 11:23:28,737 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:28,737 INFO ]: Found error trace [2018-06-22 11:23:28,737 INFO ]: trace histogram [6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:28,737 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:28,737 INFO ]: Analyzing trace with hash -1106015694, now seen corresponding path program 8 times [2018-06-22 11:23:28,737 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:28,737 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:28,738 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:28,738 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:28,738 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:28,744 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:28,872 INFO ]: Checked inductivity of 49 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:23:28,872 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:28,872 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:23:28,877 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:23:28,892 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:23:28,892 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:28,893 INFO ]: Computing forward predicates... [2018-06-22 11:23:29,051 INFO ]: Checked inductivity of 49 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:23:29,069 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:29,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2018-06-22 11:23:29,070 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:23:29,070 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:23:29,070 INFO ]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:23:29,070 INFO ]: Start difference. First operand 263 states and 744 transitions. Second operand 21 states. [2018-06-22 11:23:30,659 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-22 11:23:31,302 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:31,302 INFO ]: Finished difference Result 677 states and 2045 transitions. [2018-06-22 11:23:31,303 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 11:23:31,303 INFO ]: Start accepts. Automaton has 21 states. Word has length 29 [2018-06-22 11:23:31,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:31,308 INFO ]: With dead ends: 677 [2018-06-22 11:23:31,308 INFO ]: Without dead ends: 677 [2018-06-22 11:23:31,309 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=791, Invalid=3369, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 11:23:31,309 INFO ]: Start minimizeSevpa. Operand 677 states. [2018-06-22 11:23:31,373 INFO ]: Finished minimizeSevpa. Reduced states from 677 to 387. [2018-06-22 11:23:31,373 INFO ]: Start removeUnreachable. Operand 387 states. [2018-06-22 11:23:31,375 INFO ]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1139 transitions. [2018-06-22 11:23:31,375 INFO ]: Start accepts. Automaton has 387 states and 1139 transitions. Word has length 29 [2018-06-22 11:23:31,375 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:31,375 INFO ]: Abstraction has 387 states and 1139 transitions. [2018-06-22 11:23:31,375 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:23:31,375 INFO ]: Start isEmpty. Operand 387 states and 1139 transitions. [2018-06-22 11:23:31,378 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:31,378 INFO ]: Found error trace [2018-06-22 11:23:31,378 INFO ]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:31,378 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:31,379 INFO ]: Analyzing trace with hash -1038830792, now seen corresponding path program 1 times [2018-06-22 11:23:31,379 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:31,379 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:31,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:31,379 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:31,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:31,384 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:31,702 INFO ]: Checked inductivity of 46 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:23:31,702 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:31,702 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:23:31,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:31,723 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:31,725 INFO ]: Computing forward predicates... [2018-06-22 11:23:31,815 INFO ]: Checked inductivity of 46 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:23:31,834 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:31,834 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:23:31,834 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:23:31,834 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:23:31,834 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:23:31,834 INFO ]: Start difference. First operand 387 states and 1139 transitions. Second operand 16 states. [2018-06-22 11:23:32,802 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:32,802 INFO ]: Finished difference Result 515 states and 1512 transitions. [2018-06-22 11:23:32,803 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:23:32,803 INFO ]: Start accepts. Automaton has 16 states. Word has length 29 [2018-06-22 11:23:32,803 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:32,807 INFO ]: With dead ends: 515 [2018-06-22 11:23:32,807 INFO ]: Without dead ends: 515 [2018-06-22 11:23:32,807 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:23:32,807 INFO ]: Start minimizeSevpa. Operand 515 states. [2018-06-22 11:23:32,832 INFO ]: Finished minimizeSevpa. Reduced states from 515 to 377. [2018-06-22 11:23:32,832 INFO ]: Start removeUnreachable. Operand 377 states. [2018-06-22 11:23:32,835 INFO ]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1101 transitions. [2018-06-22 11:23:32,835 INFO ]: Start accepts. Automaton has 377 states and 1101 transitions. Word has length 29 [2018-06-22 11:23:32,835 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:32,835 INFO ]: Abstraction has 377 states and 1101 transitions. [2018-06-22 11:23:32,835 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:23:32,835 INFO ]: Start isEmpty. Operand 377 states and 1101 transitions. [2018-06-22 11:23:32,839 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:32,839 INFO ]: Found error trace [2018-06-22 11:23:32,839 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:32,839 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:32,839 INFO ]: Analyzing trace with hash 2130233761, now seen corresponding path program 9 times [2018-06-22 11:23:32,839 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:32,839 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:32,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:32,840 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:32,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:32,846 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:33,069 INFO ]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:23:33,070 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:33,070 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:33,075 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:23:33,093 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:23:33,093 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:33,094 INFO ]: Computing forward predicates... [2018-06-22 11:23:33,186 INFO ]: Checked inductivity of 51 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:23:33,205 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:33,205 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 20 [2018-06-22 11:23:33,205 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:23:33,205 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:23:33,206 INFO ]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:23:33,206 INFO ]: Start difference. First operand 377 states and 1101 transitions. Second operand 20 states. [2018-06-22 11:23:33,766 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:33,767 INFO ]: Finished difference Result 535 states and 1625 transitions. [2018-06-22 11:23:33,771 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:23:33,771 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:23:33,771 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:33,776 INFO ]: With dead ends: 535 [2018-06-22 11:23:33,776 INFO ]: Without dead ends: 535 [2018-06-22 11:23:33,777 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=696, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:23:33,777 INFO ]: Start minimizeSevpa. Operand 535 states. [2018-06-22 11:23:33,819 INFO ]: Finished minimizeSevpa. Reduced states from 535 to 395. [2018-06-22 11:23:33,819 INFO ]: Start removeUnreachable. Operand 395 states. [2018-06-22 11:23:33,821 INFO ]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1164 transitions. [2018-06-22 11:23:33,821 INFO ]: Start accepts. Automaton has 395 states and 1164 transitions. Word has length 29 [2018-06-22 11:23:33,821 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:33,821 INFO ]: Abstraction has 395 states and 1164 transitions. [2018-06-22 11:23:33,821 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:23:33,822 INFO ]: Start isEmpty. Operand 395 states and 1164 transitions. [2018-06-22 11:23:33,825 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:33,825 INFO ]: Found error trace [2018-06-22 11:23:33,826 INFO ]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:33,826 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:33,826 INFO ]: Analyzing trace with hash -767844811, now seen corresponding path program 2 times [2018-06-22 11:23:33,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:33,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:33,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:33,827 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:33,827 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:33,832 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:33,893 INFO ]: Checked inductivity of 46 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:23:33,893 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:33,893 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:33,899 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:23:33,915 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:23:33,915 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:33,917 INFO ]: Computing forward predicates... [2018-06-22 11:23:34,050 INFO ]: Checked inductivity of 46 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:23:34,070 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:34,070 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:23:34,070 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:23:34,070 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:23:34,070 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:23:34,070 INFO ]: Start difference. First operand 395 states and 1164 transitions. Second operand 16 states. [2018-06-22 11:23:34,876 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:34,876 INFO ]: Finished difference Result 547 states and 1552 transitions. [2018-06-22 11:23:34,876 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:23:34,876 INFO ]: Start accepts. Automaton has 16 states. Word has length 29 [2018-06-22 11:23:34,876 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:34,879 INFO ]: With dead ends: 547 [2018-06-22 11:23:34,879 INFO ]: Without dead ends: 547 [2018-06-22 11:23:34,880 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:23:34,880 INFO ]: Start minimizeSevpa. Operand 547 states. [2018-06-22 11:23:34,909 INFO ]: Finished minimizeSevpa. Reduced states from 547 to 453. [2018-06-22 11:23:34,909 INFO ]: Start removeUnreachable. Operand 453 states. [2018-06-22 11:23:34,911 INFO ]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1257 transitions. [2018-06-22 11:23:34,911 INFO ]: Start accepts. Automaton has 453 states and 1257 transitions. Word has length 29 [2018-06-22 11:23:34,911 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:34,911 INFO ]: Abstraction has 453 states and 1257 transitions. [2018-06-22 11:23:34,911 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:23:34,911 INFO ]: Start isEmpty. Operand 453 states and 1257 transitions. [2018-06-22 11:23:34,918 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:34,918 INFO ]: Found error trace [2018-06-22 11:23:34,918 INFO ]: trace histogram [6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:34,918 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:34,918 INFO ]: Analyzing trace with hash -1339185254, now seen corresponding path program 2 times [2018-06-22 11:23:34,918 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:34,918 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:34,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:34,919 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:34,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:34,925 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:34,989 INFO ]: Checked inductivity of 47 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:23:34,989 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:34,989 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:34,996 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:23:35,013 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:23:35,013 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:35,014 INFO ]: Computing forward predicates... [2018-06-22 11:23:35,087 INFO ]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:23:35,105 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:35,105 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-22 11:23:35,106 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:23:35,106 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:23:35,106 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:23:35,106 INFO ]: Start difference. First operand 453 states and 1257 transitions. Second operand 16 states. [2018-06-22 11:23:36,129 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:36,129 INFO ]: Finished difference Result 725 states and 2124 transitions. [2018-06-22 11:23:36,129 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:23:36,129 INFO ]: Start accepts. Automaton has 16 states. Word has length 29 [2018-06-22 11:23:36,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:36,134 INFO ]: With dead ends: 725 [2018-06-22 11:23:36,134 INFO ]: Without dead ends: 725 [2018-06-22 11:23:36,135 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:23:36,135 INFO ]: Start minimizeSevpa. Operand 725 states. [2018-06-22 11:23:36,177 INFO ]: Finished minimizeSevpa. Reduced states from 725 to 567. [2018-06-22 11:23:36,177 INFO ]: Start removeUnreachable. Operand 567 states. [2018-06-22 11:23:36,179 INFO ]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1650 transitions. [2018-06-22 11:23:36,179 INFO ]: Start accepts. Automaton has 567 states and 1650 transitions. Word has length 29 [2018-06-22 11:23:36,179 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:36,179 INFO ]: Abstraction has 567 states and 1650 transitions. [2018-06-22 11:23:36,179 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:23:36,179 INFO ]: Start isEmpty. Operand 567 states and 1650 transitions. [2018-06-22 11:23:36,182 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:36,183 INFO ]: Found error trace [2018-06-22 11:23:36,183 INFO ]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:36,183 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:36,183 INFO ]: Analyzing trace with hash -1627948333, now seen corresponding path program 1 times [2018-06-22 11:23:36,183 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:36,183 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:36,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:36,183 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:23:36,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:36,188 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:36,364 INFO ]: Checked inductivity of 46 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:23:36,364 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:36,364 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:36,370 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:36,385 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:36,386 INFO ]: Computing forward predicates... [2018-06-22 11:23:36,493 INFO ]: Checked inductivity of 46 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:23:36,512 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:36,512 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-06-22 11:23:36,512 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:23:36,512 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:23:36,512 INFO ]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:23:36,512 INFO ]: Start difference. First operand 567 states and 1650 transitions. Second operand 20 states. [2018-06-22 11:23:38,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:38,121 INFO ]: Finished difference Result 639 states and 1885 transitions. [2018-06-22 11:23:38,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:23:38,121 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:23:38,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:38,126 INFO ]: With dead ends: 639 [2018-06-22 11:23:38,126 INFO ]: Without dead ends: 639 [2018-06-22 11:23:38,126 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=1586, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:23:38,127 INFO ]: Start minimizeSevpa. Operand 639 states. [2018-06-22 11:23:38,164 INFO ]: Finished minimizeSevpa. Reduced states from 639 to 577. [2018-06-22 11:23:38,164 INFO ]: Start removeUnreachable. Operand 577 states. [2018-06-22 11:23:38,167 INFO ]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1683 transitions. [2018-06-22 11:23:38,168 INFO ]: Start accepts. Automaton has 577 states and 1683 transitions. Word has length 29 [2018-06-22 11:23:38,168 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:38,168 INFO ]: Abstraction has 577 states and 1683 transitions. [2018-06-22 11:23:38,168 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:23:38,168 INFO ]: Start isEmpty. Operand 577 states and 1683 transitions. [2018-06-22 11:23:38,173 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:23:38,173 INFO ]: Found error trace [2018-06-22 11:23:38,173 INFO ]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:38,173 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:38,174 INFO ]: Analyzing trace with hash 489487349, now seen corresponding path program 3 times [2018-06-22 11:23:38,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:38,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:38,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:38,174 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:38,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:38,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:38,364 INFO ]: Checked inductivity of 48 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:23:38,364 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:23:38,364 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:23:38,369 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:23:38,387 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:23:38,387 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:38,388 INFO ]: Computing forward predicates... [2018-06-22 11:23:38,566 INFO ]: Checked inductivity of 48 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:23:38,584 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:23:38,584 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2018-06-22 11:23:38,584 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:23:38,584 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:23:38,585 INFO ]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:23:38,585 INFO ]: Start difference. First operand 577 states and 1683 transitions. Second operand 22 states. Received shutdown request... [2018-06-22 11:23:38,725 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:23:38,725 WARN ]: Verification canceled [2018-06-22 11:23:38,728 WARN ]: Timeout [2018-06-22 11:23:38,728 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:23:38 BoogieIcfgContainer [2018-06-22 11:23:38,728 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:23:38,729 INFO ]: Toolchain (without parser) took 57417.73 ms. Allocated memory was 309.3 MB in the beginning and 828.4 MB in the end (delta: 519.0 MB). Free memory was 261.7 MB in the beginning and 577.7 MB in the end (delta: -316.0 MB). Peak memory consumption was 203.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:38,730 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:23:38,730 INFO ]: ChcToBoogie took 61.35 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 258.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:23:38,730 INFO ]: Boogie Preprocessor took 65.16 ms. Allocated memory is still 309.3 MB. Free memory was 258.7 MB in the beginning and 257.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 11:23:38,730 INFO ]: RCFGBuilder took 644.99 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 241.7 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:38,731 INFO ]: TraceAbstraction took 56636.61 ms. Allocated memory was 309.3 MB in the beginning and 828.4 MB in the end (delta: 519.0 MB). Free memory was 240.7 MB in the beginning and 577.7 MB in the end (delta: -336.9 MB). Peak memory consumption was 182.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:38,734 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 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.35 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 258.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 65.16 ms. Allocated memory is still 309.3 MB. Free memory was 258.7 MB in the beginning and 257.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 644.99 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 241.7 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56636.61 ms. Allocated memory was 309.3 MB in the beginning and 828.4 MB in the end (delta: 519.0 MB). Free memory was 240.7 MB in the beginning and 577.7 MB in the end (delta: -336.9 MB). Peak memory consumption was 182.1 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 BasicCegarLoop was constructing difference of abstraction (577states) and interpolant automaton (currently 9 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. TIMEOUT Result, 56.5s OverallTime, 50 OverallIterations, 6 TraceHistogramMax, 37.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3383 SDtfs, 695 SDslu, 19986 SDs, 0 SdLazy, 27018 SolverSat, 4661 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1941 GetRequests, 879 SyntacticMatches, 5 SemanticMatches, 1056 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5590 ImplicationChecksByTransitivity, 25.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=577occurred in iteration=49, 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.0s AutomataMinimizationTime, 49 MinimizatonAttempts, 2274 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 1950 NumberOfCodeBlocks, 1942 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 1860 ConstructedInterpolants, 26 QuantifiedInterpolants, 180060 SizeOfPredicates, 348 NumberOfNonLiveVariables, 4848 ConjunctsInSsa, 767 ConjunctsInUnsatCore, 90 InterpolantComputations, 10 PerfectInterpolantSequences, 1005/1903 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/025-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-23-38-744.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-23-38-744.csv Completed graceful shutdown