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/002d-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:08:10,491 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:08:10,493 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:08:10,505 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:08:10,505 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:08:10,506 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:08:10,508 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:08:10,513 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:08:10,514 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:08:10,515 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:08:10,518 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:08:10,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:08:10,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:08:10,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:08:10,523 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:08:10,524 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:08:10,526 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:08:10,537 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:08:10,539 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:08:10,540 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:08:10,541 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:08:10,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:08:10,549 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:08:10,550 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:08:10,550 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:08:10,551 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:08:10,557 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:08:10,558 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:08:10,559 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:08:10,559 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:08:10,560 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:08:10,561 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:08:10,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:08:10,562 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:08:10,562 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:08:10,563 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:10,577 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:08:10,577 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:08:10,577 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:08:10,578 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:08:10,579 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:08:10,579 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:08:10,579 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:08:10,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:08:10,580 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:08:10,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:08:10,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:08:10,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:08:10,581 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:08:10,581 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:08:10,581 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:08:10,581 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:08:10,581 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:08:10,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:08:10,582 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:08:10,583 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:08:10,583 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:08:10,626 INFO ]: Repository-Root is: /tmp [2018-06-22 11:08:10,661 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:08:10,667 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:08:10,669 INFO ]: Initializing SmtParser... [2018-06-22 11:08:10,669 INFO ]: SmtParser initialized [2018-06-22 11:08:10,670 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/002d-horn.smt2 [2018-06-22 11:08:10,672 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:10,781 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/002d-horn.smt2 unknown [2018-06-22 11:08:11,021 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/002d-horn.smt2 [2018-06-22 11:08:11,029 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:08:11,034 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:08:11,034 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:08:11,034 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:08:11,035 INFO ]: ChcToBoogie initialized [2018-06-22 11:08:11,042 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:08:11" (1/1) ... [2018-06-22 11:08:11,093 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:11 Unit [2018-06-22 11:08:11,093 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:08:11,096 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:08:11,096 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:08:11,096 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:08:11,118 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:11" (1/1) ... [2018-06-22 11:08:11,118 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:11" (1/1) ... [2018-06-22 11:08:11,126 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:11" (1/1) ... [2018-06-22 11:08:11,126 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:11" (1/1) ... [2018-06-22 11:08:11,132 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:11" (1/1) ... [2018-06-22 11:08:11,135 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:11" (1/1) ... [2018-06-22 11:08:11,147 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:11" (1/1) ... [2018-06-22 11:08:11,149 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:08:11,149 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:08:11,149 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:08:11,149 INFO ]: RCFGBuilder initialized [2018-06-22 11:08:11,150 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:11" (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:11,171 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:08:11,171 INFO ]: Found specification of procedure False [2018-06-22 11:08:11,171 INFO ]: Found implementation of procedure False [2018-06-22 11:08:11,171 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:08:11,171 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:08:11,171 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:08:11,171 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:08:11,171 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:08:11,171 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:08:11,171 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:08:11,171 INFO ]: Found specification of procedure REC__f [2018-06-22 11:08:11,171 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:08:11,171 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:08:11,171 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:08:11,172 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:11,561 INFO ]: Using library mode [2018-06-22 11:08:11,562 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:08:11 BoogieIcfgContainer [2018-06-22 11:08:11,562 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:08:11,569 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:08:11,569 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:08:11,572 INFO ]: TraceAbstraction initialized [2018-06-22 11:08:11,572 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:08:11" (1/3) ... [2018-06-22 11:08:11,573 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c585f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:08:11, skipping insertion in model container [2018-06-22 11:08:11,573 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:11" (2/3) ... [2018-06-22 11:08:11,573 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c585f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:08:11, skipping insertion in model container [2018-06-22 11:08:11,573 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:08:11" (3/3) ... [2018-06-22 11:08:11,577 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:08:11,587 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:08:11,593 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:08:11,635 INFO ]: Using default assertion order modulation [2018-06-22 11:08:11,635 INFO ]: Interprodecural is true [2018-06-22 11:08:11,635 INFO ]: Hoare is false [2018-06-22 11:08:11,635 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:08:11,635 INFO ]: Backedges is TWOTRACK [2018-06-22 11:08:11,635 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:08:11,635 INFO ]: Difference is false [2018-06-22 11:08:11,635 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:08:11,635 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:08:11,649 INFO ]: Start isEmpty. Operand 29 states. [2018-06-22 11:08:11,660 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:08:11,660 INFO ]: Found error trace [2018-06-22 11:08:11,661 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:08:11,661 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:11,666 INFO ]: Analyzing trace with hash 134559885, now seen corresponding path program 1 times [2018-06-22 11:08:11,668 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:11,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:11,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:11,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:11,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:11,723 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:11,745 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:11,746 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:11,747 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:08:11,748 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:08:11,759 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:08:11,759 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:08:11,761 INFO ]: Start difference. First operand 29 states. Second operand 2 states. [2018-06-22 11:08:11,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:11,783 INFO ]: Finished difference Result 25 states and 44 transitions. [2018-06-22 11:08:11,783 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:08:11,784 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:08:11,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:11,808 INFO ]: With dead ends: 25 [2018-06-22 11:08:11,808 INFO ]: Without dead ends: 25 [2018-06-22 11:08:11,809 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:08:11,822 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:08:11,843 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 11:08:11,844 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:08:11,846 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2018-06-22 11:08:11,847 INFO ]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 5 [2018-06-22 11:08:11,847 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:11,847 INFO ]: Abstraction has 25 states and 44 transitions. [2018-06-22 11:08:11,847 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:08:11,847 INFO ]: Start isEmpty. Operand 25 states and 44 transitions. [2018-06-22 11:08:11,849 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:08:11,849 INFO ]: Found error trace [2018-06-22 11:08:11,849 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:11,849 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:11,850 INFO ]: Analyzing trace with hash 1765711526, now seen corresponding path program 1 times [2018-06-22 11:08:11,850 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:11,850 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:11,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:11,850 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:11,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:11,879 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:11,995 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:11,995 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:11,995 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:11,997 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:11,997 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:11,998 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:11,998 INFO ]: Start difference. First operand 25 states and 44 transitions. Second operand 4 states. [2018-06-22 11:08:12,051 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:12,051 INFO ]: Finished difference Result 29 states and 48 transitions. [2018-06-22 11:08:12,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:12,051 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:08:12,051 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:12,052 INFO ]: With dead ends: 29 [2018-06-22 11:08:12,052 INFO ]: Without dead ends: 29 [2018-06-22 11:08:12,053 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:12,053 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:08:12,063 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 11:08:12,063 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:08:12,064 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2018-06-22 11:08:12,064 INFO ]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 9 [2018-06-22 11:08:12,065 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:12,065 INFO ]: Abstraction has 27 states and 46 transitions. [2018-06-22 11:08:12,065 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:12,065 INFO ]: Start isEmpty. Operand 27 states and 46 transitions. [2018-06-22 11:08:12,066 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:08:12,066 INFO ]: Found error trace [2018-06-22 11:08:12,066 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:12,066 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:12,067 INFO ]: Analyzing trace with hash 1880228130, now seen corresponding path program 1 times [2018-06-22 11:08:12,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:12,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:12,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:12,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:12,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:12,077 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:12,122 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:12,122 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:12,123 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:12,123 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:12,123 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:12,123 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:12,123 INFO ]: Start difference. First operand 27 states and 46 transitions. Second operand 4 states. [2018-06-22 11:08:12,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:12,260 INFO ]: Finished difference Result 31 states and 50 transitions. [2018-06-22 11:08:12,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:12,261 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:08:12,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:12,262 INFO ]: With dead ends: 31 [2018-06-22 11:08:12,262 INFO ]: Without dead ends: 31 [2018-06-22 11:08:12,262 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:12,262 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:08:12,267 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:08:12,267 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:08:12,268 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2018-06-22 11:08:12,268 INFO ]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 9 [2018-06-22 11:08:12,268 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:12,268 INFO ]: Abstraction has 27 states and 46 transitions. [2018-06-22 11:08:12,268 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:12,268 INFO ]: Start isEmpty. Operand 27 states and 46 transitions. [2018-06-22 11:08:12,269 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:08:12,269 INFO ]: Found error trace [2018-06-22 11:08:12,269 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:12,270 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:12,270 INFO ]: Analyzing trace with hash 1651194922, now seen corresponding path program 1 times [2018-06-22 11:08:12,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:12,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:12,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:12,271 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:12,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:12,279 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:12,361 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:12,361 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:12,361 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:12,361 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:12,361 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:12,361 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:12,361 INFO ]: Start difference. First operand 27 states and 46 transitions. Second operand 4 states. [2018-06-22 11:08:12,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:12,528 INFO ]: Finished difference Result 31 states and 50 transitions. [2018-06-22 11:08:12,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:12,529 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:08:12,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:12,530 INFO ]: With dead ends: 31 [2018-06-22 11:08:12,530 INFO ]: Without dead ends: 31 [2018-06-22 11:08:12,530 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:12,530 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:08:12,535 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:08:12,535 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:08:12,536 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2018-06-22 11:08:12,536 INFO ]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 9 [2018-06-22 11:08:12,537 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:12,537 INFO ]: Abstraction has 27 states and 46 transitions. [2018-06-22 11:08:12,538 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:12,538 INFO ]: Start isEmpty. Operand 27 states and 46 transitions. [2018-06-22 11:08:12,539 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:08:12,539 INFO ]: Found error trace [2018-06-22 11:08:12,539 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:12,539 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:12,539 INFO ]: Analyzing trace with hash -1493563878, now seen corresponding path program 1 times [2018-06-22 11:08:12,539 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:12,539 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:12,540 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:12,540 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:12,540 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:12,547 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:12,601 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:12,601 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:12,601 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:12,602 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:12,602 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:12,602 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:12,602 INFO ]: Start difference. First operand 27 states and 46 transitions. Second operand 4 states. [2018-06-22 11:08:12,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:12,657 INFO ]: Finished difference Result 31 states and 54 transitions. [2018-06-22 11:08:12,657 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:12,657 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:08:12,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:12,658 INFO ]: With dead ends: 31 [2018-06-22 11:08:12,658 INFO ]: Without dead ends: 31 [2018-06-22 11:08:12,658 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:12,659 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:08:12,665 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:08:12,665 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:08:12,666 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 52 transitions. [2018-06-22 11:08:12,666 INFO ]: Start accepts. Automaton has 29 states and 52 transitions. Word has length 9 [2018-06-22 11:08:12,666 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:12,666 INFO ]: Abstraction has 29 states and 52 transitions. [2018-06-22 11:08:12,666 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:12,667 INFO ]: Start isEmpty. Operand 29 states and 52 transitions. [2018-06-22 11:08:12,668 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:08:12,668 INFO ]: Found error trace [2018-06-22 11:08:12,668 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:12,668 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:12,668 INFO ]: Analyzing trace with hash -996964636, now seen corresponding path program 1 times [2018-06-22 11:08:12,668 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:12,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:12,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:12,668 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:12,668 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:12,673 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:12,716 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:12,716 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:12,716 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:12,716 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:12,716 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:12,716 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:12,716 INFO ]: Start difference. First operand 29 states and 52 transitions. Second operand 4 states. [2018-06-22 11:08:12,842 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:12,842 INFO ]: Finished difference Result 31 states and 53 transitions. [2018-06-22 11:08:12,842 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:12,842 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:08:12,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:12,843 INFO ]: With dead ends: 31 [2018-06-22 11:08:12,843 INFO ]: Without dead ends: 31 [2018-06-22 11:08:12,844 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:12,844 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:08:12,849 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:08:12,849 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:08:12,850 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 51 transitions. [2018-06-22 11:08:12,850 INFO ]: Start accepts. Automaton has 29 states and 51 transitions. Word has length 9 [2018-06-22 11:08:12,850 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:12,851 INFO ]: Abstraction has 29 states and 51 transitions. [2018-06-22 11:08:12,851 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:12,851 INFO ]: Start isEmpty. Operand 29 states and 51 transitions. [2018-06-22 11:08:12,852 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:12,852 INFO ]: Found error trace [2018-06-22 11:08:12,852 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:12,853 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:12,853 INFO ]: Analyzing trace with hash 994043361, now seen corresponding path program 1 times [2018-06-22 11:08:12,853 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:12,853 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:12,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:12,854 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:12,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:12,865 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:12,962 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:12,962 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:12,962 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:08:12,963 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:08:12,963 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:08:12,963 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:08:12,963 INFO ]: Start difference. First operand 29 states and 51 transitions. Second operand 6 states. [2018-06-22 11:08:13,245 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:13,245 INFO ]: Finished difference Result 39 states and 63 transitions. [2018-06-22 11:08:13,246 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:08:13,246 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:08:13,246 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:13,247 INFO ]: With dead ends: 39 [2018-06-22 11:08:13,247 INFO ]: Without dead ends: 39 [2018-06-22 11:08:13,247 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:08:13,247 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:08:13,254 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-06-22 11:08:13,254 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:08:13,255 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2018-06-22 11:08:13,255 INFO ]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 13 [2018-06-22 11:08:13,255 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:13,255 INFO ]: Abstraction has 31 states and 54 transitions. [2018-06-22 11:08:13,255 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:08:13,256 INFO ]: Start isEmpty. Operand 31 states and 54 transitions. [2018-06-22 11:08:13,257 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:13,257 INFO ]: Found error trace [2018-06-22 11:08:13,257 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:13,257 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:13,257 INFO ]: Analyzing trace with hash -997001140, now seen corresponding path program 1 times [2018-06-22 11:08:13,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:13,257 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:13,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:13,258 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:13,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:13,268 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:13,330 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:13,330 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:13,330 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:08:13,330 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:08:13,330 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:08:13,330 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:08:13,331 INFO ]: Start difference. First operand 31 states and 54 transitions. Second operand 6 states. [2018-06-22 11:08:13,745 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:13,745 INFO ]: Finished difference Result 41 states and 66 transitions. [2018-06-22 11:08:13,745 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:08:13,745 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:08:13,745 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:13,746 INFO ]: With dead ends: 41 [2018-06-22 11:08:13,746 INFO ]: Without dead ends: 41 [2018-06-22 11:08:13,746 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:08:13,747 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:08:13,753 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 31. [2018-06-22 11:08:13,754 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:08:13,755 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2018-06-22 11:08:13,755 INFO ]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 13 [2018-06-22 11:08:13,755 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:13,755 INFO ]: Abstraction has 31 states and 54 transitions. [2018-06-22 11:08:13,755 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:08:13,755 INFO ]: Start isEmpty. Operand 31 states and 54 transitions. [2018-06-22 11:08:13,759 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:13,759 INFO ]: Found error trace [2018-06-22 11:08:13,759 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:13,759 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:13,759 INFO ]: Analyzing trace with hash 1679272904, now seen corresponding path program 1 times [2018-06-22 11:08:13,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:13,759 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:13,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:13,760 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:13,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:13,769 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:13,906 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-06-22 11:08:13,928 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:13,928 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:13,928 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:13,929 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:13,929 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:13,929 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:13,929 INFO ]: Start difference. First operand 31 states and 54 transitions. Second operand 4 states. [2018-06-22 11:08:13,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:13,989 INFO ]: Finished difference Result 37 states and 61 transitions. [2018-06-22 11:08:13,989 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:13,989 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:08:13,989 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:13,989 INFO ]: With dead ends: 37 [2018-06-22 11:08:13,989 INFO ]: Without dead ends: 37 [2018-06-22 11:08:13,990 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:13,990 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:08:13,994 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-06-22 11:08:13,994 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:08:13,995 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 56 transitions. [2018-06-22 11:08:13,995 INFO ]: Start accepts. Automaton has 33 states and 56 transitions. Word has length 13 [2018-06-22 11:08:13,995 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:13,995 INFO ]: Abstraction has 33 states and 56 transitions. [2018-06-22 11:08:13,995 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:13,996 INFO ]: Start isEmpty. Operand 33 states and 56 transitions. [2018-06-22 11:08:13,996 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:13,996 INFO ]: Found error trace [2018-06-22 11:08:13,996 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:13,996 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:13,997 INFO ]: Analyzing trace with hash 1733708368, now seen corresponding path program 1 times [2018-06-22 11:08:13,997 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:13,997 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:13,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:13,997 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:13,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:14,006 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:14,089 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:14,089 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:14,089 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:08:14,089 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:08:14,089 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:08:14,089 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:08:14,090 INFO ]: Start difference. First operand 33 states and 56 transitions. Second operand 6 states. [2018-06-22 11:08:14,228 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:14,228 INFO ]: Finished difference Result 41 states and 65 transitions. [2018-06-22 11:08:14,228 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:08:14,228 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:08:14,229 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:14,229 INFO ]: With dead ends: 41 [2018-06-22 11:08:14,229 INFO ]: Without dead ends: 41 [2018-06-22 11:08:14,229 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:08:14,229 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:08:14,235 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-06-22 11:08:14,235 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:08:14,236 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 56 transitions. [2018-06-22 11:08:14,236 INFO ]: Start accepts. Automaton has 33 states and 56 transitions. Word has length 13 [2018-06-22 11:08:14,236 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:14,236 INFO ]: Abstraction has 33 states and 56 transitions. [2018-06-22 11:08:14,236 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:08:14,236 INFO ]: Start isEmpty. Operand 33 states and 56 transitions. [2018-06-22 11:08:14,237 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:14,237 INFO ]: Found error trace [2018-06-22 11:08:14,237 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:14,237 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:14,237 INFO ]: Analyzing trace with hash -1183503615, now seen corresponding path program 1 times [2018-06-22 11:08:14,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:14,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:14,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:14,238 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:14,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:14,245 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:14,454 WARN ]: Spent 160.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-06-22 11:08:14,464 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:14,464 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:14,464 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:14,464 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:14,464 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:14,464 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:14,464 INFO ]: Start difference. First operand 33 states and 56 transitions. Second operand 4 states. [2018-06-22 11:08:14,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:14,508 INFO ]: Finished difference Result 37 states and 60 transitions. [2018-06-22 11:08:14,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:14,508 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:08:14,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:14,509 INFO ]: With dead ends: 37 [2018-06-22 11:08:14,509 INFO ]: Without dead ends: 34 [2018-06-22 11:08:14,509 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:14,510 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:08:14,514 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-06-22 11:08:14,514 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:08:14,515 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 51 transitions. [2018-06-22 11:08:14,515 INFO ]: Start accepts. Automaton has 32 states and 51 transitions. Word has length 13 [2018-06-22 11:08:14,515 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:14,515 INFO ]: Abstraction has 32 states and 51 transitions. [2018-06-22 11:08:14,515 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:14,515 INFO ]: Start isEmpty. Operand 32 states and 51 transitions. [2018-06-22 11:08:14,516 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:14,516 INFO ]: Found error trace [2018-06-22 11:08:14,516 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:14,516 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:14,516 INFO ]: Analyzing trace with hash 1492770429, now seen corresponding path program 1 times [2018-06-22 11:08:14,516 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:14,516 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:14,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:14,517 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:14,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:14,536 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:14,617 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:14,617 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:08:14,617 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:14,624 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:14,659 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:14,671 INFO ]: Computing forward predicates... [2018-06-22 11:08:14,942 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:14,962 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:08:14,962 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:08:14,962 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:08:14,962 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:08:14,962 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:08:14,962 INFO ]: Start difference. First operand 32 states and 51 transitions. Second operand 6 states. [2018-06-22 11:08:15,040 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:15,040 INFO ]: Finished difference Result 40 states and 60 transitions. [2018-06-22 11:08:15,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:08:15,040 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:08:15,040 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:15,041 INFO ]: With dead ends: 40 [2018-06-22 11:08:15,041 INFO ]: Without dead ends: 40 [2018-06-22 11:08:15,041 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:08:15,041 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:08:15,045 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-06-22 11:08:15,045 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:08:15,046 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 53 transitions. [2018-06-22 11:08:15,046 INFO ]: Start accepts. Automaton has 34 states and 53 transitions. Word has length 13 [2018-06-22 11:08:15,046 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:15,046 INFO ]: Abstraction has 34 states and 53 transitions. [2018-06-22 11:08:15,046 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:08:15,046 INFO ]: Start isEmpty. Operand 34 states and 53 transitions. [2018-06-22 11:08:15,047 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:15,047 INFO ]: Found error trace [2018-06-22 11:08:15,047 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:15,047 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:15,047 INFO ]: Analyzing trace with hash 435189637, now seen corresponding path program 1 times [2018-06-22 11:08:15,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:15,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:15,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:15,048 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:15,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:15,055 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:15,089 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:08:15,089 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:15,089 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:08:15,089 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:08:15,089 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:08:15,089 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:08:15,089 INFO ]: Start difference. First operand 34 states and 53 transitions. Second operand 5 states. [2018-06-22 11:08:15,314 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:15,314 INFO ]: Finished difference Result 44 states and 64 transitions. [2018-06-22 11:08:15,315 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:08:15,315 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:08:15,315 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:15,316 INFO ]: With dead ends: 44 [2018-06-22 11:08:15,316 INFO ]: Without dead ends: 40 [2018-06-22 11:08:15,316 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:08:15,316 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:08:15,321 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-06-22 11:08:15,321 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:08:15,321 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions. [2018-06-22 11:08:15,321 INFO ]: Start accepts. Automaton has 34 states and 52 transitions. Word has length 13 [2018-06-22 11:08:15,321 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:15,321 INFO ]: Abstraction has 34 states and 52 transitions. [2018-06-22 11:08:15,321 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:08:15,321 INFO ]: Start isEmpty. Operand 34 states and 52 transitions. [2018-06-22 11:08:15,322 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:15,322 INFO ]: Found error trace [2018-06-22 11:08:15,322 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:15,322 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:15,322 INFO ]: Analyzing trace with hash 322575998, now seen corresponding path program 1 times [2018-06-22 11:08:15,322 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:15,322 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:15,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:15,323 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:15,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:15,327 INFO ]: Conjunction of SSA is sat [2018-06-22 11:08:15,328 INFO ]: Counterexample might be feasible [2018-06-22 11:08:15,347 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:08:15 BoogieIcfgContainer [2018-06-22 11:08:15,347 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:08:15,348 INFO ]: Toolchain (without parser) took 4318.31 ms. Allocated memory was 316.7 MB in the beginning and 328.2 MB in the end (delta: 11.5 MB). Free memory was 269.1 MB in the beginning and 195.6 MB in the end (delta: 73.4 MB). Peak memory consumption was 85.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:15,349 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 316.7 MB. Free memory is still 281.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:08:15,349 INFO ]: ChcToBoogie took 59.06 ms. Allocated memory is still 316.7 MB. Free memory was 269.1 MB in the beginning and 267.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:15,351 INFO ]: Boogie Preprocessor took 53.18 ms. Allocated memory is still 316.7 MB. Free memory is still 267.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:08:15,351 INFO ]: RCFGBuilder took 412.51 ms. Allocated memory is still 316.7 MB. Free memory was 267.1 MB in the beginning and 253.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:15,352 INFO ]: TraceAbstraction took 3778.81 ms. Allocated memory was 316.7 MB in the beginning and 328.2 MB in the end (delta: 11.5 MB). Free memory was 253.1 MB in the beginning and 195.6 MB in the end (delta: 57.5 MB). Peak memory consumption was 69.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:15,356 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 316.7 MB. Free memory is still 281.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.06 ms. Allocated memory is still 316.7 MB. Free memory was 269.1 MB in the beginning and 267.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 53.18 ms. Allocated memory is still 316.7 MB. Free memory is still 267.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 412.51 ms. Allocated memory is still 316.7 MB. Free memory was 267.1 MB in the beginning and 253.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3778.81 ms. Allocated memory was 316.7 MB in the beginning and 328.2 MB in the end (delta: 11.5 MB). Free memory was 253.1 MB in the beginning and 195.6 MB in the end (delta: 57.5 MB). Peak memory consumption was 69.0 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_2_Int == 0) && hbv_False_1_Int + -2 == 0) && hbv_False_2_Int + -1 == hbv_False_5_Int) && hbv_False_3_Int == hbv_False_6_Int) && !(hbv_False_7_Int == hbv_False_6_Int)) && !(hbv_False_1_Int == 0)) && hbv_False_2_Int == hbv_False_1_Int) && hbv_False_3_Int + 1 == hbv_False_4_Int) && !(hbv_False_1_Int + -1 == 0); [L0] CALL call REC_f_(hbv_False_5_Int, hbv_False_4_Int, hbv_False_7_Int); [L0] assume (!(hhv_REC_f__0_Int == 0) && hhv_REC_f__0_Int + -1 == hbv_REC_f__1_Int) && hhv_REC_f__1_Int + 1 == hbv_REC_f__2_Int; [L0] CALL call REC_f_(hbv_REC_f__1_Int, hbv_REC_f__2_Int, hhv_REC_f__2_Int); [L0] assume hhv_REC_f__2_Int == hhv_REC_f__1_Int && hhv_REC_f__0_Int == 0; [L0] RET call REC_f_(hbv_REC_f__1_Int, hbv_REC_f__2_Int, hhv_REC_f__2_Int); [L0] RET call REC_f_(hbv_False_5_Int, hbv_False_4_Int, hbv_False_7_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. UNSAFE Result, 3.7s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 570 SDtfs, 19 SDslu, 1168 SDs, 0 SdLazy, 350 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=12, 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, 13 MinimizatonAttempts, 58 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 5108 SizeOfPredicates, 3 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 8/12 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/002d-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-08-15-366.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/002d-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-08-15-366.csv Received shutdown request...