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/003c-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:08:38,070 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:08:38,077 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:08:38,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:08:38,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:08:38,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:08:38,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:08:38,099 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:08:38,101 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:08:38,102 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:08:38,105 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:08:38,105 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:08:38,106 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:08:38,107 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:08:38,110 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:08:38,111 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:08:38,120 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:08:38,123 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:08:38,125 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:08:38,126 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:08:38,130 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:08:38,135 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:08:38,135 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:08:38,135 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:08:38,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:08:38,137 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:08:38,138 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:08:38,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:08:38,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:08:38,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:08:38,141 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:08:38,146 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:08:38,146 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:08:38,147 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:08:38,148 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:08:38,148 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:08:38,164 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:08:38,164 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:08:38,165 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:08:38,165 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:08:38,166 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:08:38,166 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:08:38,166 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:08:38,167 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:08:38,167 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:08:38,167 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:08:38,167 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:08:38,167 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:08:38,167 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:08:38,168 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:08:38,168 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:08:38,168 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:08:38,168 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:08:38,168 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:08:38,169 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:08:38,186 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:08:38,186 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:08:38,259 INFO ]: Repository-Root is: /tmp [2018-06-22 11:08:38,329 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:08:38,334 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:08:38,335 INFO ]: Initializing SmtParser... [2018-06-22 11:08:38,335 INFO ]: SmtParser initialized [2018-06-22 11:08:38,336 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/003c-horn.smt2 [2018-06-22 11:08:38,338 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:08:38,447 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003c-horn.smt2 unknown [2018-06-22 11:08:38,770 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003c-horn.smt2 [2018-06-22 11:08:38,780 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:08:38,789 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:08:38,790 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:08:38,790 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:08:38,790 INFO ]: ChcToBoogie initialized [2018-06-22 11:08:38,794 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:08:38" (1/1) ... [2018-06-22 11:08:38,848 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:38 Unit [2018-06-22 11:08:38,848 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:08:38,851 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:08:38,851 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:08:38,851 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:08:38,895 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:38" (1/1) ... [2018-06-22 11:08:38,895 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:38" (1/1) ... [2018-06-22 11:08:38,916 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:38" (1/1) ... [2018-06-22 11:08:38,917 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:38" (1/1) ... [2018-06-22 11:08:38,921 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:38" (1/1) ... [2018-06-22 11:08:38,923 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:38" (1/1) ... [2018-06-22 11:08:38,927 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:38" (1/1) ... [2018-06-22 11:08:38,929 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:08:38,930 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:08:38,930 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:08:38,930 INFO ]: RCFGBuilder initialized [2018-06-22 11:08:38,931 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:38" (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:08:38,975 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:08:38,975 INFO ]: Found specification of procedure False [2018-06-22 11:08:38,975 INFO ]: Found implementation of procedure False [2018-06-22 11:08:38,976 INFO ]: Specification and implementation of procedure INV1 given in one single declaration [2018-06-22 11:08:38,976 INFO ]: Found specification of procedure INV1 [2018-06-22 11:08:38,976 INFO ]: Found implementation of procedure INV1 [2018-06-22 11:08:38,976 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:08:38,977 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:08:38,977 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:08:39,246 INFO ]: Using library mode [2018-06-22 11:08:39,246 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:08:39 BoogieIcfgContainer [2018-06-22 11:08:39,246 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:08:39,248 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:08:39,248 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:08:39,261 INFO ]: TraceAbstraction initialized [2018-06-22 11:08:39,261 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:08:38" (1/3) ... [2018-06-22 11:08:39,263 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595b9608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:08:39, skipping insertion in model container [2018-06-22 11:08:39,263 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:38" (2/3) ... [2018-06-22 11:08:39,263 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595b9608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:08:39, skipping insertion in model container [2018-06-22 11:08:39,263 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:08:39" (3/3) ... [2018-06-22 11:08:39,265 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:08:39,285 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:08:39,302 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:08:39,390 INFO ]: Using default assertion order modulation [2018-06-22 11:08:39,390 INFO ]: Interprodecural is true [2018-06-22 11:08:39,390 INFO ]: Hoare is false [2018-06-22 11:08:39,390 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:08:39,391 INFO ]: Backedges is TWOTRACK [2018-06-22 11:08:39,391 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:08:39,391 INFO ]: Difference is false [2018-06-22 11:08:39,391 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:08:39,391 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:08:39,409 INFO ]: Start isEmpty. Operand 17 states. [2018-06-22 11:08:39,429 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:08:39,429 INFO ]: Found error trace [2018-06-22 11:08:39,430 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:39,430 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:39,436 INFO ]: Analyzing trace with hash -1002426576, now seen corresponding path program 1 times [2018-06-22 11:08:39,438 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:39,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:39,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:39,476 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:39,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:39,527 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:39,666 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:08:39,669 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:39,669 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:39,671 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:39,683 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:39,683 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:39,686 INFO ]: Start difference. First operand 17 states. Second operand 4 states. [2018-06-22 11:08:39,897 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:39,897 INFO ]: Finished difference Result 17 states and 30 transitions. [2018-06-22 11:08:39,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:39,899 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:08:39,899 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:39,909 INFO ]: With dead ends: 17 [2018-06-22 11:08:39,909 INFO ]: Without dead ends: 17 [2018-06-22 11:08:39,911 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:08:39,926 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 11:08:39,954 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 11:08:39,956 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:08:39,957 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2018-06-22 11:08:39,958 INFO ]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 9 [2018-06-22 11:08:39,959 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:39,959 INFO ]: Abstraction has 17 states and 30 transitions. [2018-06-22 11:08:39,959 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:39,959 INFO ]: Start isEmpty. Operand 17 states and 30 transitions. [2018-06-22 11:08:39,961 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:39,961 INFO ]: Found error trace [2018-06-22 11:08:39,961 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:39,961 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:39,962 INFO ]: Analyzing trace with hash -1486845126, now seen corresponding path program 1 times [2018-06-22 11:08:39,962 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:39,962 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:39,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:39,963 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:39,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:39,987 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:40,180 WARN ]: Spent 117.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-06-22 11:08:40,350 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:08:40,350 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:40,350 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:08:40,357 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:40,409 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:40,419 INFO ]: Computing forward predicates... [2018-06-22 11:08:40,562 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:08:40,597 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:40,597 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:08:40,598 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:08:40,598 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:08:40,598 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:08:40,598 INFO ]: Start difference. First operand 17 states and 30 transitions. Second operand 8 states. [2018-06-22 11:08:41,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:41,181 INFO ]: Finished difference Result 21 states and 43 transitions. [2018-06-22 11:08:41,182 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:08:41,182 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:08:41,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:41,183 INFO ]: With dead ends: 21 [2018-06-22 11:08:41,183 INFO ]: Without dead ends: 21 [2018-06-22 11:08:41,184 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:08:41,184 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:08:41,192 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 11:08:41,192 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:08:41,193 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2018-06-22 11:08:41,194 INFO ]: Start accepts. Automaton has 19 states and 36 transitions. Word has length 13 [2018-06-22 11:08:41,194 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:41,194 INFO ]: Abstraction has 19 states and 36 transitions. [2018-06-22 11:08:41,194 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:08:41,194 INFO ]: Start isEmpty. Operand 19 states and 36 transitions. [2018-06-22 11:08:41,195 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:41,195 INFO ]: Found error trace [2018-06-22 11:08:41,195 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:41,195 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:41,196 INFO ]: Analyzing trace with hash -210289400, now seen corresponding path program 1 times [2018-06-22 11:08:41,196 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:41,196 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:41,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:41,197 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:41,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:41,207 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:41,298 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:08:41,299 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:41,299 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:41,299 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:41,299 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:41,299 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:41,299 INFO ]: Start difference. First operand 19 states and 36 transitions. Second operand 4 states. [2018-06-22 11:08:41,711 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:41,711 INFO ]: Finished difference Result 23 states and 46 transitions. [2018-06-22 11:08:41,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:41,712 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:08:41,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:41,713 INFO ]: With dead ends: 23 [2018-06-22 11:08:41,713 INFO ]: Without dead ends: 23 [2018-06-22 11:08:41,713 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:08:41,713 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:08:41,723 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-22 11:08:41,723 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:08:41,724 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-06-22 11:08:41,724 INFO ]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 13 [2018-06-22 11:08:41,724 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:41,724 INFO ]: Abstraction has 21 states and 39 transitions. [2018-06-22 11:08:41,724 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:41,724 INFO ]: Start isEmpty. Operand 21 states and 39 transitions. [2018-06-22 11:08:41,725 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:41,725 INFO ]: Found error trace [2018-06-22 11:08:41,725 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:41,726 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:41,726 INFO ]: Analyzing trace with hash -1584319822, now seen corresponding path program 1 times [2018-06-22 11:08:41,726 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:41,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:41,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:41,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:41,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:41,742 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:41,790 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:08:41,790 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:41,790 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:41,790 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:41,791 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:41,791 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:41,791 INFO ]: Start difference. First operand 21 states and 39 transitions. Second operand 4 states. [2018-06-22 11:08:41,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:41,822 INFO ]: Finished difference Result 25 states and 49 transitions. [2018-06-22 11:08:41,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:41,823 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:08:41,823 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:41,824 INFO ]: With dead ends: 25 [2018-06-22 11:08:41,824 INFO ]: Without dead ends: 25 [2018-06-22 11:08:41,825 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:08:41,825 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:08:41,833 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:08:41,834 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:08:41,835 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2018-06-22 11:08:41,835 INFO ]: Start accepts. Automaton has 23 states and 42 transitions. Word has length 13 [2018-06-22 11:08:41,835 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:41,835 INFO ]: Abstraction has 23 states and 42 transitions. [2018-06-22 11:08:41,835 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:41,835 INFO ]: Start isEmpty. Operand 23 states and 42 transitions. [2018-06-22 11:08:41,836 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:41,836 INFO ]: Found error trace [2018-06-22 11:08:41,836 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:41,837 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:41,837 INFO ]: Analyzing trace with hash -1241594273, now seen corresponding path program 1 times [2018-06-22 11:08:41,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:41,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:41,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:41,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:41,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:41,846 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:41,926 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:08:41,926 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:41,926 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:41,926 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:41,926 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:41,927 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:41,927 INFO ]: Start difference. First operand 23 states and 42 transitions. Second operand 4 states. [2018-06-22 11:08:42,206 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:42,206 INFO ]: Finished difference Result 23 states and 43 transitions. [2018-06-22 11:08:42,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:42,206 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:08:42,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:42,208 INFO ]: With dead ends: 23 [2018-06-22 11:08:42,208 INFO ]: Without dead ends: 23 [2018-06-22 11:08:42,208 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:08:42,208 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:08:42,216 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 11:08:42,216 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:08:42,217 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 43 transitions. [2018-06-22 11:08:42,217 INFO ]: Start accepts. Automaton has 23 states and 43 transitions. Word has length 13 [2018-06-22 11:08:42,217 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:42,217 INFO ]: Abstraction has 23 states and 43 transitions. [2018-06-22 11:08:42,217 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:42,217 INFO ]: Start isEmpty. Operand 23 states and 43 transitions. [2018-06-22 11:08:42,219 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:08:42,219 INFO ]: Found error trace [2018-06-22 11:08:42,219 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:42,219 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:42,219 INFO ]: Analyzing trace with hash 2013909692, now seen corresponding path program 1 times [2018-06-22 11:08:42,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:42,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:42,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:42,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:42,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:42,248 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:42,294 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:08:42,294 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:42,294 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:08:42,301 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:42,332 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:42,334 INFO ]: Computing forward predicates... [2018-06-22 11:08:42,378 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:08:42,478 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:42,478 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:08:42,479 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:08:42,479 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:08:42,479 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:08:42,479 INFO ]: Start difference. First operand 23 states and 43 transitions. Second operand 6 states. [2018-06-22 11:08:42,694 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:42,694 INFO ]: Finished difference Result 27 states and 53 transitions. [2018-06-22 11:08:42,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:08:42,695 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:08:42,695 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:42,696 INFO ]: With dead ends: 27 [2018-06-22 11:08:42,696 INFO ]: Without dead ends: 27 [2018-06-22 11:08:42,697 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:08:42,697 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:08:42,709 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:08:42,709 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:08:42,710 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. [2018-06-22 11:08:42,710 INFO ]: Start accepts. Automaton has 25 states and 46 transitions. Word has length 17 [2018-06-22 11:08:42,710 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:42,710 INFO ]: Abstraction has 25 states and 46 transitions. [2018-06-22 11:08:42,710 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:08:42,710 INFO ]: Start isEmpty. Operand 25 states and 46 transitions. [2018-06-22 11:08:42,714 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:08:42,714 INFO ]: Found error trace [2018-06-22 11:08:42,714 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:42,714 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:42,714 INFO ]: Analyzing trace with hash -1472460476, now seen corresponding path program 2 times [2018-06-22 11:08:42,714 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:42,714 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:42,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:42,715 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:42,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:42,737 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:42,897 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:08:42,897 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:42,897 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:08:42,912 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:08:42,948 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:08:42,948 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:42,952 INFO ]: Computing forward predicates... [2018-06-22 11:08:43,165 INFO ]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:08:43,189 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:43,189 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:08:43,190 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:08:43,190 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:08:43,190 INFO ]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:08:43,190 INFO ]: Start difference. First operand 25 states and 46 transitions. Second operand 13 states. [2018-06-22 11:08:43,493 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:43,493 INFO ]: Finished difference Result 31 states and 65 transitions. [2018-06-22 11:08:43,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:08:43,494 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:08:43,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:43,495 INFO ]: With dead ends: 31 [2018-06-22 11:08:43,495 INFO ]: Without dead ends: 31 [2018-06-22 11:08:43,497 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:08:43,497 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:08:43,511 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:08:43,512 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:08:43,512 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 52 transitions. [2018-06-22 11:08:43,512 INFO ]: Start accepts. Automaton has 27 states and 52 transitions. Word has length 17 [2018-06-22 11:08:43,513 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:43,516 INFO ]: Abstraction has 27 states and 52 transitions. [2018-06-22 11:08:43,516 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:08:43,517 INFO ]: Start isEmpty. Operand 27 states and 52 transitions. [2018-06-22 11:08:43,518 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:08:43,518 INFO ]: Found error trace [2018-06-22 11:08:43,518 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:43,518 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:43,518 INFO ]: Analyzing trace with hash -1925478894, now seen corresponding path program 1 times [2018-06-22 11:08:43,518 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:43,518 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:43,519 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:43,519 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:43,519 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:43,536 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:43,593 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:08:43,593 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:43,593 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:08:43,593 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:08:43,593 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:08:43,593 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:08:43,594 INFO ]: Start difference. First operand 27 states and 52 transitions. Second operand 5 states. [2018-06-22 11:08:43,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:43,736 INFO ]: Finished difference Result 31 states and 60 transitions. [2018-06-22 11:08:43,736 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:08:43,736 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:08:43,736 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:43,738 INFO ]: With dead ends: 31 [2018-06-22 11:08:43,738 INFO ]: Without dead ends: 31 [2018-06-22 11:08:43,738 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:08:43,738 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:08:43,745 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:08:43,745 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:08:43,745 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 48 transitions. [2018-06-22 11:08:43,746 INFO ]: Start accepts. Automaton has 27 states and 48 transitions. Word has length 17 [2018-06-22 11:08:43,746 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:43,746 INFO ]: Abstraction has 27 states and 48 transitions. [2018-06-22 11:08:43,746 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:08:43,746 INFO ]: Start isEmpty. Operand 27 states and 48 transitions. [2018-06-22 11:08:43,747 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:08:43,747 INFO ]: Found error trace [2018-06-22 11:08:43,747 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:43,747 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:43,748 INFO ]: Analyzing trace with hash 1584880361, now seen corresponding path program 1 times [2018-06-22 11:08:43,748 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:43,748 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:43,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:43,748 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:43,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:43,759 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:43,803 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:08:43,803 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:43,803 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:08:43,803 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:08:43,803 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:08:43,803 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:08:43,804 INFO ]: Start difference. First operand 27 states and 48 transitions. Second operand 5 states. [2018-06-22 11:08:43,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:43,913 INFO ]: Finished difference Result 31 states and 60 transitions. [2018-06-22 11:08:43,913 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:08:43,913 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:08:43,913 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:43,914 INFO ]: With dead ends: 31 [2018-06-22 11:08:43,914 INFO ]: Without dead ends: 31 [2018-06-22 11:08:43,914 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:08:43,915 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:08:43,921 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-22 11:08:43,921 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:08:43,922 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2018-06-22 11:08:43,922 INFO ]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 17 [2018-06-22 11:08:43,922 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:43,922 INFO ]: Abstraction has 25 states and 42 transitions. [2018-06-22 11:08:43,922 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:08:43,922 INFO ]: Start isEmpty. Operand 25 states and 42 transitions. [2018-06-22 11:08:43,923 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:08:43,923 INFO ]: Found error trace [2018-06-22 11:08:43,923 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:43,923 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:43,923 INFO ]: Analyzing trace with hash -2142645050, now seen corresponding path program 2 times [2018-06-22 11:08:43,923 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:43,923 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:43,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:43,924 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:43,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:43,936 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:43,977 INFO ]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:08:43,977 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:43,977 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:43,983 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:08:44,024 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:08:44,025 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:44,027 INFO ]: Computing forward predicates... [2018-06-22 11:08:44,037 INFO ]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:08:44,057 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:44,057 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:08:44,057 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:08:44,057 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:08:44,058 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:08:44,058 INFO ]: Start difference. First operand 25 states and 42 transitions. Second operand 7 states. [2018-06-22 11:08:44,520 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:44,521 INFO ]: Finished difference Result 33 states and 62 transitions. [2018-06-22 11:08:44,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:08:44,522 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:08:44,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:44,523 INFO ]: With dead ends: 33 [2018-06-22 11:08:44,523 INFO ]: Without dead ends: 33 [2018-06-22 11:08:44,524 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:08:44,524 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:08:44,533 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-22 11:08:44,534 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:08:44,535 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 44 transitions. [2018-06-22 11:08:44,535 INFO ]: Start accepts. Automaton has 27 states and 44 transitions. Word has length 21 [2018-06-22 11:08:44,536 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:44,536 INFO ]: Abstraction has 27 states and 44 transitions. [2018-06-22 11:08:44,536 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:08:44,536 INFO ]: Start isEmpty. Operand 27 states and 44 transitions. [2018-06-22 11:08:44,536 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:08:44,536 INFO ]: Found error trace [2018-06-22 11:08:44,536 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:44,537 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:44,537 INFO ]: Analyzing trace with hash 1796110544, now seen corresponding path program 3 times [2018-06-22 11:08:44,537 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:44,537 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:44,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:44,537 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:44,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:44,570 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:44,710 INFO ]: Checked inductivity of 33 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:08:44,711 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:44,711 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:08:44,718 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:08:44,805 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:08:44,805 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:44,808 INFO ]: Computing forward predicates... [2018-06-22 11:08:45,262 INFO ]: Checked inductivity of 33 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:08:45,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:45,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:08:45,283 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:08:45,283 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:08:45,283 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:08:45,284 INFO ]: Start difference. First operand 27 states and 44 transitions. Second operand 16 states. [2018-06-22 11:08:45,679 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:45,679 INFO ]: Finished difference Result 35 states and 64 transitions. [2018-06-22 11:08:45,679 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:08:45,679 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 11:08:45,680 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:45,680 INFO ]: With dead ends: 35 [2018-06-22 11:08:45,680 INFO ]: Without dead ends: 35 [2018-06-22 11:08:45,681 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:08:45,681 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:08:45,687 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-22 11:08:45,687 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:08:45,687 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 46 transitions. [2018-06-22 11:08:45,687 INFO ]: Start accepts. Automaton has 29 states and 46 transitions. Word has length 25 [2018-06-22 11:08:45,687 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:45,687 INFO ]: Abstraction has 29 states and 46 transitions. [2018-06-22 11:08:45,687 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:08:45,687 INFO ]: Start isEmpty. Operand 29 states and 46 transitions. [2018-06-22 11:08:45,688 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:08:45,688 INFO ]: Found error trace [2018-06-22 11:08:45,688 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:45,689 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:45,689 INFO ]: Analyzing trace with hash -236650790, now seen corresponding path program 4 times [2018-06-22 11:08:45,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:45,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:45,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:45,689 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:45,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:45,703 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:45,855 INFO ]: Checked inductivity of 51 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:08:45,856 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:45,856 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:08:45,863 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:08:45,892 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:08:45,892 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:45,895 INFO ]: Computing forward predicates... [2018-06-22 11:08:45,912 INFO ]: Checked inductivity of 51 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:08:45,946 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:45,946 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:08:45,946 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:08:45,946 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:08:45,946 INFO ]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:08:45,947 INFO ]: Start difference. First operand 29 states and 46 transitions. Second operand 9 states. [2018-06-22 11:08:46,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:46,033 INFO ]: Finished difference Result 37 states and 66 transitions. [2018-06-22 11:08:46,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:08:46,033 INFO ]: Start accepts. Automaton has 9 states. Word has length 29 [2018-06-22 11:08:46,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:46,034 INFO ]: With dead ends: 37 [2018-06-22 11:08:46,034 INFO ]: Without dead ends: 37 [2018-06-22 11:08:46,034 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:08:46,035 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:08:46,040 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-06-22 11:08:46,040 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:08:46,041 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2018-06-22 11:08:46,041 INFO ]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 29 [2018-06-22 11:08:46,041 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:46,041 INFO ]: Abstraction has 31 states and 48 transitions. [2018-06-22 11:08:46,041 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:08:46,041 INFO ]: Start isEmpty. Operand 31 states and 48 transitions. [2018-06-22 11:08:46,042 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:08:46,042 INFO ]: Found error trace [2018-06-22 11:08:46,042 INFO ]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:46,042 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:46,042 INFO ]: Analyzing trace with hash 1395304164, now seen corresponding path program 5 times [2018-06-22 11:08:46,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:46,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:46,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:46,043 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:46,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:46,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:46,196 INFO ]: Checked inductivity of 73 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:08:46,196 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:46,196 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:08:46,211 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:08:46,284 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 11:08:46,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:46,287 INFO ]: Computing forward predicates... [2018-06-22 11:08:46,307 INFO ]: Checked inductivity of 73 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:08:46,328 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:46,328 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:08:46,329 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:08:46,329 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:08:46,329 INFO ]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:08:46,329 INFO ]: Start difference. First operand 31 states and 48 transitions. Second operand 10 states. [2018-06-22 11:08:46,572 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:46,572 INFO ]: Finished difference Result 39 states and 68 transitions. [2018-06-22 11:08:46,572 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:08:46,572 INFO ]: Start accepts. Automaton has 10 states. Word has length 33 [2018-06-22 11:08:46,572 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:46,573 INFO ]: With dead ends: 39 [2018-06-22 11:08:46,573 INFO ]: Without dead ends: 39 [2018-06-22 11:08:46,573 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:08:46,573 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:08:46,578 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-06-22 11:08:46,578 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:08:46,579 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2018-06-22 11:08:46,579 INFO ]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 33 [2018-06-22 11:08:46,579 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:46,579 INFO ]: Abstraction has 33 states and 50 transitions. [2018-06-22 11:08:46,579 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:08:46,579 INFO ]: Start isEmpty. Operand 33 states and 50 transitions. [2018-06-22 11:08:46,580 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:08:46,580 INFO ]: Found error trace [2018-06-22 11:08:46,580 INFO ]: trace histogram [8, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:46,581 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:46,582 INFO ]: Analyzing trace with hash -838029074, now seen corresponding path program 6 times [2018-06-22 11:08:46,582 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:46,582 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:46,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:46,583 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:46,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:46,600 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:46,718 INFO ]: Checked inductivity of 99 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:08:46,718 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:46,718 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:08:46,727 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:08:46,817 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:08:46,817 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:46,821 INFO ]: Computing forward predicates... [2018-06-22 11:08:46,843 INFO ]: Checked inductivity of 99 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:08:46,863 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:46,863 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:08:46,864 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:08:46,864 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:08:46,864 INFO ]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:08:46,864 INFO ]: Start difference. First operand 33 states and 50 transitions. Second operand 11 states. [2018-06-22 11:08:47,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:47,045 INFO ]: Finished difference Result 41 states and 70 transitions. [2018-06-22 11:08:47,045 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:08:47,045 INFO ]: Start accepts. Automaton has 11 states. Word has length 37 [2018-06-22 11:08:47,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:47,046 INFO ]: With dead ends: 41 [2018-06-22 11:08:47,046 INFO ]: Without dead ends: 41 [2018-06-22 11:08:47,046 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:08:47,046 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:08:47,052 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 35. [2018-06-22 11:08:47,052 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:08:47,052 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2018-06-22 11:08:47,052 INFO ]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 37 [2018-06-22 11:08:47,053 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:47,053 INFO ]: Abstraction has 35 states and 52 transitions. [2018-06-22 11:08:47,053 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:08:47,053 INFO ]: Start isEmpty. Operand 35 states and 52 transitions. [2018-06-22 11:08:47,054 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:08:47,054 INFO ]: Found error trace [2018-06-22 11:08:47,054 INFO ]: trace histogram [9, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:47,054 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:47,054 INFO ]: Analyzing trace with hash 512253176, now seen corresponding path program 7 times [2018-06-22 11:08:47,054 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:47,054 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:47,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:47,055 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:47,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:47,077 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:47,531 INFO ]: Checked inductivity of 129 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:08:47,531 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:47,544 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:08:47,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:47,593 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:47,597 INFO ]: Computing forward predicates... [2018-06-22 11:08:47,615 INFO ]: Checked inductivity of 129 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:08:47,640 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:47,640 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 11:08:47,641 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:08:47,641 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:08:47,641 INFO ]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:08:47,641 INFO ]: Start difference. First operand 35 states and 52 transitions. Second operand 12 states. [2018-06-22 11:08:47,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:47,885 INFO ]: Finished difference Result 43 states and 72 transitions. [2018-06-22 11:08:47,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:08:47,885 INFO ]: Start accepts. Automaton has 12 states. Word has length 41 [2018-06-22 11:08:47,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:47,886 INFO ]: With dead ends: 43 [2018-06-22 11:08:47,886 INFO ]: Without dead ends: 43 [2018-06-22 11:08:47,887 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:08:47,887 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:08:47,896 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-06-22 11:08:47,896 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:08:47,897 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2018-06-22 11:08:47,897 INFO ]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 41 [2018-06-22 11:08:47,898 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:47,898 INFO ]: Abstraction has 37 states and 54 transitions. [2018-06-22 11:08:47,898 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:08:47,898 INFO ]: Start isEmpty. Operand 37 states and 54 transitions. [2018-06-22 11:08:47,899 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:08:47,899 INFO ]: Found error trace [2018-06-22 11:08:47,899 INFO ]: trace histogram [10, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:47,899 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:47,899 INFO ]: Analyzing trace with hash -110433534, now seen corresponding path program 8 times [2018-06-22 11:08:47,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:47,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:47,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:47,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:47,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:47,919 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:48,453 INFO ]: Checked inductivity of 163 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-22 11:08:48,453 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:48,453 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:08:48,460 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:08:48,520 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:08:48,520 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:48,524 INFO ]: Computing forward predicates... [2018-06-22 11:08:48,552 INFO ]: Checked inductivity of 163 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-22 11:08:48,572 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:48,572 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 11:08:48,573 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:08:48,573 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:08:48,573 INFO ]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:08:48,573 INFO ]: Start difference. First operand 37 states and 54 transitions. Second operand 13 states. [2018-06-22 11:08:48,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:48,866 INFO ]: Finished difference Result 45 states and 74 transitions. [2018-06-22 11:08:48,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:08:48,867 INFO ]: Start accepts. Automaton has 13 states. Word has length 45 [2018-06-22 11:08:48,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:48,867 INFO ]: With dead ends: 45 [2018-06-22 11:08:48,867 INFO ]: Without dead ends: 45 [2018-06-22 11:08:48,868 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:08:48,868 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:08:48,872 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 39. [2018-06-22 11:08:48,872 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:08:48,873 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2018-06-22 11:08:48,873 INFO ]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 45 [2018-06-22 11:08:48,873 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:48,873 INFO ]: Abstraction has 39 states and 56 transitions. [2018-06-22 11:08:48,873 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:08:48,873 INFO ]: Start isEmpty. Operand 39 states and 56 transitions. [2018-06-22 11:08:48,874 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:08:48,874 INFO ]: Found error trace [2018-06-22 11:08:48,874 INFO ]: trace histogram [11, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:48,874 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:48,875 INFO ]: Analyzing trace with hash -2007917812, now seen corresponding path program 9 times [2018-06-22 11:08:48,875 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:48,875 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:48,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:48,875 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:48,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:48,896 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:49,930 INFO ]: Checked inductivity of 201 backedges. 20 proven. 90 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:08:49,931 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:49,931 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:08:49,939 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:08:50,041 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 11:08:50,041 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:50,045 INFO ]: Computing forward predicates... [2018-06-22 11:08:50,765 INFO ]: Checked inductivity of 201 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 11:08:50,793 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:50,793 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2018-06-22 11:08:50,794 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:08:50,794 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:08:50,794 INFO ]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:08:50,794 INFO ]: Start difference. First operand 39 states and 56 transitions. Second operand 28 states. [2018-06-22 11:08:51,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:51,614 INFO ]: Finished difference Result 47 states and 76 transitions. [2018-06-22 11:08:51,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:08:51,614 INFO ]: Start accepts. Automaton has 28 states. Word has length 49 [2018-06-22 11:08:51,615 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:51,615 INFO ]: With dead ends: 47 [2018-06-22 11:08:51,615 INFO ]: Without dead ends: 47 [2018-06-22 11:08:51,616 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=352, Invalid=1288, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:08:51,616 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:08:51,620 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-06-22 11:08:51,620 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:08:51,621 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2018-06-22 11:08:51,621 INFO ]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 49 [2018-06-22 11:08:51,621 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:51,621 INFO ]: Abstraction has 41 states and 58 transitions. [2018-06-22 11:08:51,621 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:08:51,621 INFO ]: Start isEmpty. Operand 41 states and 58 transitions. [2018-06-22 11:08:51,622 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:08:51,622 INFO ]: Found error trace [2018-06-22 11:08:51,622 INFO ]: trace histogram [12, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:51,623 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:51,623 INFO ]: Analyzing trace with hash -441864938, now seen corresponding path program 10 times [2018-06-22 11:08:51,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:51,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:51,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:51,623 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:51,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:51,673 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:52,508 INFO ]: Checked inductivity of 243 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 11:08:52,508 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:52,508 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:08:52,515 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:08:52,592 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:08:52,592 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:52,605 INFO ]: Computing forward predicates... [2018-06-22 11:08:53,563 INFO ]: Checked inductivity of 243 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-06-22 11:08:53,595 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:53,596 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17] total 40 [2018-06-22 11:08:53,596 INFO ]: Interpolant automaton has 40 states [2018-06-22 11:08:53,596 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 11:08:53,596 INFO ]: CoverageRelationStatistics Valid=225, Invalid=1335, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:08:53,597 INFO ]: Start difference. First operand 41 states and 58 transitions. Second operand 40 states. [2018-06-22 11:08:54,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:54,881 INFO ]: Finished difference Result 55 states and 94 transitions. [2018-06-22 11:08:54,882 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:08:54,882 INFO ]: Start accepts. Automaton has 40 states. Word has length 53 [2018-06-22 11:08:54,882 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:54,883 INFO ]: With dead ends: 55 [2018-06-22 11:08:54,883 INFO ]: Without dead ends: 55 [2018-06-22 11:08:54,884 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=559, Invalid=2303, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 11:08:54,884 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:08:54,891 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 43. [2018-06-22 11:08:54,891 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:08:54,896 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2018-06-22 11:08:54,896 INFO ]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 53 [2018-06-22 11:08:54,896 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:54,896 INFO ]: Abstraction has 43 states and 64 transitions. [2018-06-22 11:08:54,896 INFO ]: Interpolant automaton has 40 states. [2018-06-22 11:08:54,896 INFO ]: Start isEmpty. Operand 43 states and 64 transitions. [2018-06-22 11:08:54,897 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:08:54,897 INFO ]: Found error trace [2018-06-22 11:08:54,897 INFO ]: trace histogram [13, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:54,897 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:54,897 INFO ]: Analyzing trace with hash -1467203296, now seen corresponding path program 11 times [2018-06-22 11:08:54,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:54,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:54,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:54,898 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:08:54,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:54,942 INFO ]: Conjunction of SSA is sat [2018-06-22 11:08:54,970 INFO ]: Counterexample might be feasible [2018-06-22 11:08:54,999 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:08:54 BoogieIcfgContainer [2018-06-22 11:08:54,999 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:08:55,000 INFO ]: Toolchain (without parser) took 16219.68 ms. Allocated memory was 308.8 MB in the beginning and 439.4 MB in the end (delta: 130.5 MB). Free memory was 263.3 MB in the beginning and 409.7 MB in the end (delta: -146.3 MB). Peak memory consumption was 189.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:55,001 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:08:55,001 INFO ]: ChcToBoogie took 61.19 ms. Allocated memory is still 308.8 MB. Free memory was 263.3 MB in the beginning and 261.3 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:08:55,002 INFO ]: Boogie Preprocessor took 77.70 ms. Allocated memory is still 308.8 MB. Free memory was 261.3 MB in the beginning and 259.4 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:08:55,002 INFO ]: RCFGBuilder took 317.02 ms. Allocated memory is still 308.8 MB. Free memory was 259.4 MB in the beginning and 249.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:55,003 INFO ]: TraceAbstraction took 15751.29 ms. Allocated memory was 308.8 MB in the beginning and 439.4 MB in the end (delta: 130.5 MB). Free memory was 249.4 MB in the beginning and 409.7 MB in the end (delta: -160.3 MB). Peak memory consumption was 175.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:55,009 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.19 ms. Allocated memory is still 308.8 MB. Free memory was 263.3 MB in the beginning and 261.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 77.70 ms. Allocated memory is still 308.8 MB. Free memory was 261.3 MB in the beginning and 259.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 317.02 ms. Allocated memory is still 308.8 MB. Free memory was 259.4 MB in the beginning and 249.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 15751.29 ms. Allocated memory was 308.8 MB in the beginning and 439.4 MB in the end (delta: 130.5 MB). Free memory was 249.4 MB in the beginning and 409.7 MB in the end (delta: -160.3 MB). Peak memory consumption was 175.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call False(); [L0] assume (((hbv_False_9_Int == hbv_False_10_Int && hbv_False_5_Int == hbv_False_6_Int) && !(hbv_False_1_Int - hbv_False_2_Int + -1 >= 0)) && !(hbv_False_7_Int == hbv_False_8_Int)) && !(hbv_False_3_Int - hbv_False_4_Int + -1 >= 0); [L0] CALL call INV1(hbv_False_3_Int, hbv_False_11_Int, hbv_False_4_Int, hbv_False_12_Int, hbv_False_7_Int, hbv_False_1_Int, hbv_False_13_Int, hbv_False_2_Int, hbv_False_14_Int, hbv_False_8_Int); [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] assume (((((((((hhv_INV1_5_Int - hbv_INV1_7_Int + -1 >= 0 && -1 * hhv_INV1_8_Int == -10) && hbv_INV1_3_Int + hbv_INV1_4_Int == hhv_INV1_9_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hbv_INV1_5_Int == hbv_INV1_6_Int) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && hbv_INV1_7_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_7_Int + -10 == 0) && hbv_INV1_8_Int == hbv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_3_Int); [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] assume (((((((((hbv_INV1_6_Int == hbv_INV1_7_Int && hbv_INV1_8_Int + 5 == hhv_INV1_8_Int) && hbv_INV1_1_Int + 1 == hhv_INV1_2_Int) && hhv_INV1_0_Int - hbv_INV1_1_Int + -1 >= 0) && hhv_INV1_5_Int - hbv_INV1_3_Int + -1 >= 0) && 5 * hbv_INV1_1_Int + hhv_INV1_1_Int == hhv_INV1_3_Int) && !(hbv_INV1_3_Int + -10 == 0)) && hbv_INV1_4_Int == hbv_INV1_5_Int) && hbv_INV1_2_Int + (5 * hbv_INV1_1_Int + hhv_INV1_1_Int) == hhv_INV1_4_Int) && hbv_INV1_3_Int + 1 == hhv_INV1_7_Int) && hbv_INV1_9_Int + hbv_INV1_8_Int == hhv_INV1_9_Int; [L0] CALL call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] assume ((((((-1 * hhv_INV1_2_Int == 0 && -1 * hhv_INV1_7_Int == 0) && -1 * hhv_INV1_3_Int == 0) && hhv_INV1_8_Int == hhv_INV1_6_Int) && -1 * hhv_INV1_9_Int == 0) && hhv_INV1_0_Int == hhv_INV1_5_Int) && hhv_INV1_1_Int == hhv_INV1_6_Int) && -1 * hhv_INV1_4_Int == 0; [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_7_Int, hbv_INV1_4_Int, hbv_INV1_3_Int); [L0] RET call INV1(hhv_INV1_0_Int, hhv_INV1_1_Int, hbv_INV1_1_Int, hbv_INV1_10_Int, hbv_INV1_2_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hbv_INV1_3_Int, hbv_INV1_8_Int, hbv_INV1_9_Int); [L0] RET call INV1(hbv_False_3_Int, hbv_False_11_Int, hbv_False_4_Int, hbv_False_12_Int, hbv_False_7_Int, hbv_False_1_Int, hbv_False_13_Int, hbv_False_2_Int, hbv_False_14_Int, hbv_False_8_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 17 locations, 1 error locations. UNSAFE Result, 15.6s OverallTime, 19 OverallIterations, 13 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 434 SDtfs, 146 SDslu, 1599 SDs, 0 SdLazy, 3251 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 635 GetRequests, 398 SyntacticMatches, 1 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 82 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 899 NumberOfCodeBlocks, 895 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 812 ConstructedInterpolants, 4 QuantifiedInterpolants, 160880 SizeOfPredicates, 128 NumberOfNonLiveVariables, 3590 ConjunctsInSsa, 442 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 1079/2093 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003c-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-08-55-019.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003c-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-08-55-019.csv Received shutdown request...