java -Xss4m -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_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/rec__add-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 10:11:01,082 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 10:11:01,084 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 10:11:01,098 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 10:11:01,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 10:11:01,099 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 10:11:01,103 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 10:11:01,105 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 10:11:01,106 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 10:11:01,108 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 10:11:01,109 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 10:11:01,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 10:11:01,110 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 10:11:01,114 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 10:11:01,115 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 10:11:01,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 10:11:01,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 10:11:01,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 10:11:01,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 10:11:01,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 10:11:01,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 10:11:01,135 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 10:11:01,135 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 10:11:01,135 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 10:11:01,139 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 10:11:01,140 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 10:11:01,141 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 10:11:01,142 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 10:11:01,143 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 10:11:01,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 10:11:01,148 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 10:11:01,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 10:11:01,148 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 10:11:01,149 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 10:11:01,150 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 10:11:01,150 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 10:11:01,166 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 10:11:01,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 10:11:01,169 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 10:11:01,169 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 10:11:01,170 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 10:11:01,170 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 10:11:01,170 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 10:11:01,170 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 10:11:01,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 10:11:01,171 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 10:11:01,171 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 10:11:01,171 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 10:11:01,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 10:11:01,172 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 10:11:01,172 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 10:11:01,172 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 10:11:01,172 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 10:11:01,172 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 10:11:01,173 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 10:11:01,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 10:11:01,173 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 10:11:01,179 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 10:11:01,179 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 10:11:01,228 INFO ]: Repository-Root is: /tmp [2018-06-25 10:11:01,246 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 10:11:01,252 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 10:11:01,253 INFO ]: Initializing SmtParser... [2018-06-25 10:11:01,253 INFO ]: SmtParser initialized [2018-06-25 10:11:01,254 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__add-horn.smt2 [2018-06-25 10:11:01,255 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-25 10:11:01,336 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__add-horn.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@39d89e75 [2018-06-25 10:11:01,618 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__add-horn.smt2 [2018-06-25 10:11:01,625 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 10:11:01,632 INFO ]: Walking toolchain with 4 elements. [2018-06-25 10:11:01,633 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 10:11:01,633 INFO ]: Initializing ChcToBoogie... [2018-06-25 10:11:01,633 INFO ]: ChcToBoogie initialized [2018-06-25 10:11:01,636 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 10:11:01" (1/1) ... [2018-06-25 10:11:01,697 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:11:01 Unit [2018-06-25 10:11:01,697 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 10:11:01,697 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 10:11:01,697 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 10:11:01,698 INFO ]: Boogie Preprocessor initialized [2018-06-25 10:11:01,716 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:11:01" (1/1) ... [2018-06-25 10:11:01,716 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:11:01" (1/1) ... [2018-06-25 10:11:01,721 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:11:01" (1/1) ... [2018-06-25 10:11:01,721 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:11:01" (1/1) ... [2018-06-25 10:11:01,726 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:11:01" (1/1) ... [2018-06-25 10:11:01,730 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:11:01" (1/1) ... [2018-06-25 10:11:01,731 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:11:01" (1/1) ... [2018-06-25 10:11:01,733 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 10:11:01,734 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 10:11:01,734 INFO ]: Initializing RCFGBuilder... [2018-06-25 10:11:01,734 INFO ]: RCFGBuilder initialized [2018-06-25 10:11:01,741 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:11:01" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 10:11:01,749 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 10:11:01,749 INFO ]: Found specification of procedure gotoProc [2018-06-25 10:11:01,750 INFO ]: Found implementation of procedure gotoProc [2018-06-25 10:11:01,750 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 10:11:01,750 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 10:11:01,750 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 10:11:02,230 INFO ]: Using library mode [2018-06-25 10:11:02,230 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 10:11:02 BoogieIcfgContainer [2018-06-25 10:11:02,230 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 10:11:02,232 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 10:11:02,232 INFO ]: Initializing TraceAbstraction... [2018-06-25 10:11:02,235 INFO ]: TraceAbstraction initialized [2018-06-25 10:11:02,236 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 10:11:01" (1/3) ... [2018-06-25 10:11:02,236 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32804ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 10:11:02, skipping insertion in model container [2018-06-25 10:11:02,237 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:11:01" (2/3) ... [2018-06-25 10:11:02,237 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32804ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 10:11:02, skipping insertion in model container [2018-06-25 10:11:02,237 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 10:11:02" (3/3) ... [2018-06-25 10:11:02,238 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 10:11:02,248 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 10:11:02,257 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 10:11:02,292 INFO ]: Using default assertion order modulation [2018-06-25 10:11:02,294 INFO ]: Interprodecural is true [2018-06-25 10:11:02,294 INFO ]: Hoare is false [2018-06-25 10:11:02,294 INFO ]: Compute interpolants for FPandBP [2018-06-25 10:11:02,294 INFO ]: Backedges is TWOTRACK [2018-06-25 10:11:02,294 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 10:11:02,294 INFO ]: Difference is false [2018-06-25 10:11:02,294 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 10:11:02,294 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 10:11:02,310 INFO ]: Start isEmpty. Operand 31 states. [2018-06-25 10:11:02,321 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 10:11:02,321 INFO ]: Found error trace [2018-06-25 10:11:02,321 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:02,321 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:02,325 INFO ]: Analyzing trace with hash 110673580, now seen corresponding path program 1 times [2018-06-25 10:11:02,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:02,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:02,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:02,370 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:02,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:02,402 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:02,489 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:11:02,495 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:02,495 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:11:02,497 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:11:02,512 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:11:02,512 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:11:02,515 INFO ]: Start difference. First operand 31 states. Second operand 4 states. [2018-06-25 10:11:03,007 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:03,007 INFO ]: Finished difference Result 55 states and 105 transitions. [2018-06-25 10:11:03,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:11:03,009 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 10:11:03,009 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:03,022 INFO ]: With dead ends: 55 [2018-06-25 10:11:03,022 INFO ]: Without dead ends: 55 [2018-06-25 10:11:03,024 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:11:03,038 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-25 10:11:03,071 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-25 10:11:03,072 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-25 10:11:03,075 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 105 transitions. [2018-06-25 10:11:03,076 INFO ]: Start accepts. Automaton has 55 states and 105 transitions. Word has length 8 [2018-06-25 10:11:03,077 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:03,077 INFO ]: Abstraction has 55 states and 105 transitions. [2018-06-25 10:11:03,077 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:11:03,077 INFO ]: Start isEmpty. Operand 55 states and 105 transitions. [2018-06-25 10:11:03,080 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 10:11:03,080 INFO ]: Found error trace [2018-06-25 10:11:03,080 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:03,080 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:03,080 INFO ]: Analyzing trace with hash -1869638617, now seen corresponding path program 1 times [2018-06-25 10:11:03,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:03,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:03,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:03,081 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:03,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:03,085 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:03,188 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:11:03,188 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:03,188 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:11:03,190 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:11:03,190 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:11:03,190 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:11:03,190 INFO ]: Start difference. First operand 55 states and 105 transitions. Second operand 4 states. [2018-06-25 10:11:03,449 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:03,449 INFO ]: Finished difference Result 81 states and 156 transitions. [2018-06-25 10:11:03,450 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:11:03,450 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 10:11:03,450 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:03,453 INFO ]: With dead ends: 81 [2018-06-25 10:11:03,453 INFO ]: Without dead ends: 81 [2018-06-25 10:11:03,458 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:11:03,458 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-25 10:11:03,469 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-06-25 10:11:03,469 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-25 10:11:03,472 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 156 transitions. [2018-06-25 10:11:03,472 INFO ]: Start accepts. Automaton has 81 states and 156 transitions. Word has length 9 [2018-06-25 10:11:03,472 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:03,472 INFO ]: Abstraction has 81 states and 156 transitions. [2018-06-25 10:11:03,472 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:11:03,472 INFO ]: Start isEmpty. Operand 81 states and 156 transitions. [2018-06-25 10:11:03,473 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 10:11:03,473 INFO ]: Found error trace [2018-06-25 10:11:03,473 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:03,473 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:03,473 INFO ]: Analyzing trace with hash -1881346480, now seen corresponding path program 1 times [2018-06-25 10:11:03,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:03,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:03,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:03,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:03,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:03,481 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:03,522 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:11:03,522 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:03,522 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:11:03,522 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:11:03,522 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:11:03,522 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:11:03,523 INFO ]: Start difference. First operand 81 states and 156 transitions. Second operand 4 states. [2018-06-25 10:11:04,024 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:04,024 INFO ]: Finished difference Result 107 states and 207 transitions. [2018-06-25 10:11:04,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:11:04,024 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 10:11:04,025 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:04,028 INFO ]: With dead ends: 107 [2018-06-25 10:11:04,028 INFO ]: Without dead ends: 107 [2018-06-25 10:11:04,028 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:11:04,029 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-25 10:11:04,044 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-06-25 10:11:04,044 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-25 10:11:04,047 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 207 transitions. [2018-06-25 10:11:04,047 INFO ]: Start accepts. Automaton has 107 states and 207 transitions. Word has length 9 [2018-06-25 10:11:04,047 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:04,047 INFO ]: Abstraction has 107 states and 207 transitions. [2018-06-25 10:11:04,048 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:11:04,048 INFO ]: Start isEmpty. Operand 107 states and 207 transitions. [2018-06-25 10:11:04,049 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 10:11:04,049 INFO ]: Found error trace [2018-06-25 10:11:04,050 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:04,050 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:04,050 INFO ]: Analyzing trace with hash 271853766, now seen corresponding path program 1 times [2018-06-25 10:11:04,050 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:04,050 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:04,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:04,051 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:04,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:04,060 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:04,098 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:11:04,098 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:04,098 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:11:04,098 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:11:04,098 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:11:04,098 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:11:04,098 INFO ]: Start difference. First operand 107 states and 207 transitions. Second operand 4 states. [2018-06-25 10:11:04,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:04,260 INFO ]: Finished difference Result 133 states and 258 transitions. [2018-06-25 10:11:04,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:11:04,261 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-25 10:11:04,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:04,263 INFO ]: With dead ends: 133 [2018-06-25 10:11:04,263 INFO ]: Without dead ends: 133 [2018-06-25 10:11:04,264 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:11:04,264 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-25 10:11:04,277 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-06-25 10:11:04,277 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-25 10:11:04,281 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 258 transitions. [2018-06-25 10:11:04,281 INFO ]: Start accepts. Automaton has 133 states and 258 transitions. Word has length 11 [2018-06-25 10:11:04,281 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:04,281 INFO ]: Abstraction has 133 states and 258 transitions. [2018-06-25 10:11:04,281 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:11:04,281 INFO ]: Start isEmpty. Operand 133 states and 258 transitions. [2018-06-25 10:11:04,284 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 10:11:04,284 INFO ]: Found error trace [2018-06-25 10:11:04,284 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:04,284 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:04,284 INFO ]: Analyzing trace with hash 574961890, now seen corresponding path program 1 times [2018-06-25 10:11:04,284 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:04,284 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:04,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:04,289 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:04,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:04,299 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:04,361 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:11:04,362 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:04,362 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 10:11:04,362 INFO ]: Interpolant automaton has 3 states [2018-06-25 10:11:04,362 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 10:11:04,362 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:11:04,362 INFO ]: Start difference. First operand 133 states and 258 transitions. Second operand 3 states. [2018-06-25 10:11:04,455 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:04,455 INFO ]: Finished difference Result 204 states and 437 transitions. [2018-06-25 10:11:04,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 10:11:04,457 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 10:11:04,457 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:04,465 INFO ]: With dead ends: 204 [2018-06-25 10:11:04,466 INFO ]: Without dead ends: 204 [2018-06-25 10:11:04,466 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:11:04,466 INFO ]: Start minimizeSevpa. Operand 204 states. [2018-06-25 10:11:04,491 INFO ]: Finished minimizeSevpa. Reduced states from 204 to 137. [2018-06-25 10:11:04,491 INFO ]: Start removeUnreachable. Operand 137 states. [2018-06-25 10:11:04,494 INFO ]: Finished removeUnreachable. Reduced from 137 states to 137 states and 277 transitions. [2018-06-25 10:11:04,494 INFO ]: Start accepts. Automaton has 137 states and 277 transitions. Word has length 12 [2018-06-25 10:11:04,495 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:04,495 INFO ]: Abstraction has 137 states and 277 transitions. [2018-06-25 10:11:04,495 INFO ]: Interpolant automaton has 3 states. [2018-06-25 10:11:04,495 INFO ]: Start isEmpty. Operand 137 states and 277 transitions. [2018-06-25 10:11:04,497 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 10:11:04,497 INFO ]: Found error trace [2018-06-25 10:11:04,497 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:04,497 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:04,497 INFO ]: Analyzing trace with hash 550950344, now seen corresponding path program 1 times [2018-06-25 10:11:04,497 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:04,497 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:04,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:04,498 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:04,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:04,511 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:04,676 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 12 [2018-06-25 10:11:04,677 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:11:04,677 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:04,677 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 10:11:04,677 INFO ]: Interpolant automaton has 3 states [2018-06-25 10:11:04,677 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 10:11:04,677 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:11:04,678 INFO ]: Start difference. First operand 137 states and 277 transitions. Second operand 3 states. [2018-06-25 10:11:04,788 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:04,788 INFO ]: Finished difference Result 204 states and 432 transitions. [2018-06-25 10:11:04,789 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 10:11:04,789 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 10:11:04,790 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:04,795 INFO ]: With dead ends: 204 [2018-06-25 10:11:04,795 INFO ]: Without dead ends: 204 [2018-06-25 10:11:04,796 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:11:04,796 INFO ]: Start minimizeSevpa. Operand 204 states. [2018-06-25 10:11:04,840 INFO ]: Finished minimizeSevpa. Reduced states from 204 to 137. [2018-06-25 10:11:04,841 INFO ]: Start removeUnreachable. Operand 137 states. [2018-06-25 10:11:04,843 INFO ]: Finished removeUnreachable. Reduced from 137 states to 137 states and 272 transitions. [2018-06-25 10:11:04,843 INFO ]: Start accepts. Automaton has 137 states and 272 transitions. Word has length 12 [2018-06-25 10:11:04,843 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:04,843 INFO ]: Abstraction has 137 states and 272 transitions. [2018-06-25 10:11:04,843 INFO ]: Interpolant automaton has 3 states. [2018-06-25 10:11:04,843 INFO ]: Start isEmpty. Operand 137 states and 272 transitions. [2018-06-25 10:11:04,845 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 10:11:04,845 INFO ]: Found error trace [2018-06-25 10:11:04,845 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:04,846 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:04,846 INFO ]: Analyzing trace with hash 705803962, now seen corresponding path program 1 times [2018-06-25 10:11:04,846 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:04,846 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:04,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:04,846 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:04,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:04,857 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:04,907 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:11:04,907 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:04,908 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 10:11:04,908 INFO ]: Interpolant automaton has 3 states [2018-06-25 10:11:04,908 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 10:11:04,908 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:11:04,908 INFO ]: Start difference. First operand 137 states and 272 transitions. Second operand 3 states. [2018-06-25 10:11:04,924 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:04,924 INFO ]: Finished difference Result 172 states and 358 transitions. [2018-06-25 10:11:04,931 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 10:11:04,931 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 10:11:04,931 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:04,934 INFO ]: With dead ends: 172 [2018-06-25 10:11:04,934 INFO ]: Without dead ends: 172 [2018-06-25 10:11:04,935 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:11:04,936 INFO ]: Start minimizeSevpa. Operand 172 states. [2018-06-25 10:11:04,955 INFO ]: Finished minimizeSevpa. Reduced states from 172 to 142. [2018-06-25 10:11:04,955 INFO ]: Start removeUnreachable. Operand 142 states. [2018-06-25 10:11:04,958 INFO ]: Finished removeUnreachable. Reduced from 142 states to 142 states and 277 transitions. [2018-06-25 10:11:04,961 INFO ]: Start accepts. Automaton has 142 states and 277 transitions. Word has length 12 [2018-06-25 10:11:04,961 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:04,961 INFO ]: Abstraction has 142 states and 277 transitions. [2018-06-25 10:11:04,961 INFO ]: Interpolant automaton has 3 states. [2018-06-25 10:11:04,961 INFO ]: Start isEmpty. Operand 142 states and 277 transitions. [2018-06-25 10:11:04,962 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 10:11:04,962 INFO ]: Found error trace [2018-06-25 10:11:04,962 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:04,963 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:04,963 INFO ]: Analyzing trace with hash 321023406, now seen corresponding path program 1 times [2018-06-25 10:11:04,963 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:04,963 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:04,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:04,963 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:04,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:04,983 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:05,072 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:11:05,072 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:05,072 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 10:11:05,072 INFO ]: Interpolant automaton has 3 states [2018-06-25 10:11:05,072 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 10:11:05,072 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:11:05,072 INFO ]: Start difference. First operand 142 states and 277 transitions. Second operand 3 states. [2018-06-25 10:11:05,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:05,135 INFO ]: Finished difference Result 161 states and 328 transitions. [2018-06-25 10:11:05,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 10:11:05,136 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 10:11:05,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:05,138 INFO ]: With dead ends: 161 [2018-06-25 10:11:05,138 INFO ]: Without dead ends: 161 [2018-06-25 10:11:05,139 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:11:05,139 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-25 10:11:05,148 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 143. [2018-06-25 10:11:05,148 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-25 10:11:05,150 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 274 transitions. [2018-06-25 10:11:05,150 INFO ]: Start accepts. Automaton has 143 states and 274 transitions. Word has length 12 [2018-06-25 10:11:05,150 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:05,150 INFO ]: Abstraction has 143 states and 274 transitions. [2018-06-25 10:11:05,150 INFO ]: Interpolant automaton has 3 states. [2018-06-25 10:11:05,150 INFO ]: Start isEmpty. Operand 143 states and 274 transitions. [2018-06-25 10:11:05,154 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 10:11:05,154 INFO ]: Found error trace [2018-06-25 10:11:05,154 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:05,155 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:05,155 INFO ]: Analyzing trace with hash -1820480142, now seen corresponding path program 1 times [2018-06-25 10:11:05,155 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:05,155 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:05,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:05,155 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:05,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:05,168 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:05,332 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 10:11:05,498 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 10:11:05,570 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 10:11:05,570 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:05,570 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-25 10:11:05,571 INFO ]: Interpolant automaton has 6 states [2018-06-25 10:11:05,571 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 10:11:05,571 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 10:11:05,571 INFO ]: Start difference. First operand 143 states and 274 transitions. Second operand 6 states. [2018-06-25 10:11:06,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:06,628 INFO ]: Finished difference Result 263 states and 629 transitions. [2018-06-25 10:11:06,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 10:11:06,629 INFO ]: Start accepts. Automaton has 6 states. Word has length 20 [2018-06-25 10:11:06,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:06,632 INFO ]: With dead ends: 263 [2018-06-25 10:11:06,632 INFO ]: Without dead ends: 234 [2018-06-25 10:11:06,632 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-25 10:11:06,632 INFO ]: Start minimizeSevpa. Operand 234 states. [2018-06-25 10:11:06,651 INFO ]: Finished minimizeSevpa. Reduced states from 234 to 151. [2018-06-25 10:11:06,651 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-25 10:11:06,653 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 299 transitions. [2018-06-25 10:11:06,653 INFO ]: Start accepts. Automaton has 151 states and 299 transitions. Word has length 20 [2018-06-25 10:11:06,653 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:06,653 INFO ]: Abstraction has 151 states and 299 transitions. [2018-06-25 10:11:06,653 INFO ]: Interpolant automaton has 6 states. [2018-06-25 10:11:06,653 INFO ]: Start isEmpty. Operand 151 states and 299 transitions. [2018-06-25 10:11:06,656 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 10:11:06,656 INFO ]: Found error trace [2018-06-25 10:11:06,656 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:06,656 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:06,656 INFO ]: Analyzing trace with hash 1035033978, now seen corresponding path program 1 times [2018-06-25 10:11:06,656 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:06,656 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:06,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:06,657 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:06,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:06,667 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:06,775 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 10:11:06,775 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:06,775 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-25 10:11:06,775 INFO ]: Interpolant automaton has 6 states [2018-06-25 10:11:06,775 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 10:11:06,775 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 10:11:06,775 INFO ]: Start difference. First operand 151 states and 299 transitions. Second operand 6 states. [2018-06-25 10:11:06,980 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:06,980 INFO ]: Finished difference Result 268 states and 688 transitions. [2018-06-25 10:11:06,980 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 10:11:06,980 INFO ]: Start accepts. Automaton has 6 states. Word has length 20 [2018-06-25 10:11:06,981 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:06,984 INFO ]: With dead ends: 268 [2018-06-25 10:11:06,984 INFO ]: Without dead ends: 268 [2018-06-25 10:11:06,984 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-25 10:11:06,985 INFO ]: Start minimizeSevpa. Operand 268 states. [2018-06-25 10:11:07,009 INFO ]: Finished minimizeSevpa. Reduced states from 268 to 161. [2018-06-25 10:11:07,009 INFO ]: Start removeUnreachable. Operand 161 states. [2018-06-25 10:11:07,012 INFO ]: Finished removeUnreachable. Reduced from 161 states to 161 states and 336 transitions. [2018-06-25 10:11:07,012 INFO ]: Start accepts. Automaton has 161 states and 336 transitions. Word has length 20 [2018-06-25 10:11:07,012 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:07,012 INFO ]: Abstraction has 161 states and 336 transitions. [2018-06-25 10:11:07,012 INFO ]: Interpolant automaton has 6 states. [2018-06-25 10:11:07,012 INFO ]: Start isEmpty. Operand 161 states and 336 transitions. [2018-06-25 10:11:07,016 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 10:11:07,016 INFO ]: Found error trace [2018-06-25 10:11:07,016 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:07,017 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:07,017 INFO ]: Analyzing trace with hash -1805820560, now seen corresponding path program 1 times [2018-06-25 10:11:07,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:07,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:07,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:07,017 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:07,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:07,030 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:07,098 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 10:11:07,098 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:11:07,098 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-25 10:11:07,104 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:07,129 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:07,137 INFO ]: Computing forward predicates... [2018-06-25 10:11:07,177 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 10:11:07,209 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:11:07,209 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-25 10:11:07,210 INFO ]: Interpolant automaton has 5 states [2018-06-25 10:11:07,210 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 10:11:07,210 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:11:07,210 INFO ]: Start difference. First operand 161 states and 336 transitions. Second operand 5 states. [2018-06-25 10:11:07,436 WARN ]: Spent 160.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-06-25 10:11:07,838 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:07,838 INFO ]: Finished difference Result 181 states and 413 transitions. [2018-06-25 10:11:07,839 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 10:11:07,839 INFO ]: Start accepts. Automaton has 5 states. Word has length 20 [2018-06-25 10:11:07,839 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:07,841 INFO ]: With dead ends: 181 [2018-06-25 10:11:07,841 INFO ]: Without dead ends: 181 [2018-06-25 10:11:07,841 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 10:11:07,841 INFO ]: Start minimizeSevpa. Operand 181 states. [2018-06-25 10:11:07,853 INFO ]: Finished minimizeSevpa. Reduced states from 181 to 161. [2018-06-25 10:11:07,853 INFO ]: Start removeUnreachable. Operand 161 states. [2018-06-25 10:11:07,855 INFO ]: Finished removeUnreachable. Reduced from 161 states to 161 states and 326 transitions. [2018-06-25 10:11:07,855 INFO ]: Start accepts. Automaton has 161 states and 326 transitions. Word has length 20 [2018-06-25 10:11:07,855 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:07,855 INFO ]: Abstraction has 161 states and 326 transitions. [2018-06-25 10:11:07,855 INFO ]: Interpolant automaton has 5 states. [2018-06-25 10:11:07,855 INFO ]: Start isEmpty. Operand 161 states and 326 transitions. [2018-06-25 10:11:07,858 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 10:11:07,858 INFO ]: Found error trace [2018-06-25 10:11:07,858 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:07,858 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:07,858 INFO ]: Analyzing trace with hash 1645055342, now seen corresponding path program 1 times [2018-06-25 10:11:07,858 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:07,858 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:07,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:07,859 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:07,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:07,866 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:08,003 INFO ]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 10:11:08,003 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:08,003 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:11:08,003 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:11:08,003 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:11:08,003 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:11:08,003 INFO ]: Start difference. First operand 161 states and 326 transitions. Second operand 4 states. [2018-06-25 10:11:08,279 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:08,279 INFO ]: Finished difference Result 187 states and 372 transitions. [2018-06-25 10:11:08,280 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:11:08,280 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-25 10:11:08,280 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:08,282 INFO ]: With dead ends: 187 [2018-06-25 10:11:08,282 INFO ]: Without dead ends: 158 [2018-06-25 10:11:08,282 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:11:08,282 INFO ]: Start minimizeSevpa. Operand 158 states. [2018-06-25 10:11:08,290 INFO ]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-06-25 10:11:08,290 INFO ]: Start removeUnreachable. Operand 158 states. [2018-06-25 10:11:08,291 INFO ]: Finished removeUnreachable. Reduced from 158 states to 158 states and 306 transitions. [2018-06-25 10:11:08,291 INFO ]: Start accepts. Automaton has 158 states and 306 transitions. Word has length 21 [2018-06-25 10:11:08,292 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:08,292 INFO ]: Abstraction has 158 states and 306 transitions. [2018-06-25 10:11:08,292 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:11:08,292 INFO ]: Start isEmpty. Operand 158 states and 306 transitions. [2018-06-25 10:11:08,295 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 10:11:08,295 INFO ]: Found error trace [2018-06-25 10:11:08,295 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:08,295 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:08,295 INFO ]: Analyzing trace with hash 780370589, now seen corresponding path program 1 times [2018-06-25 10:11:08,295 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:08,295 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:08,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:08,296 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:08,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:08,302 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:08,347 INFO ]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 10:11:08,347 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:08,347 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 10:11:08,348 INFO ]: Interpolant automaton has 3 states [2018-06-25 10:11:08,348 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 10:11:08,348 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:11:08,348 INFO ]: Start difference. First operand 158 states and 306 transitions. Second operand 3 states. [2018-06-25 10:11:08,431 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:08,431 INFO ]: Finished difference Result 178 states and 369 transitions. [2018-06-25 10:11:08,431 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 10:11:08,431 INFO ]: Start accepts. Automaton has 3 states. Word has length 21 [2018-06-25 10:11:08,431 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:08,433 INFO ]: With dead ends: 178 [2018-06-25 10:11:08,433 INFO ]: Without dead ends: 178 [2018-06-25 10:11:08,433 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:11:08,433 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-25 10:11:08,443 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 163. [2018-06-25 10:11:08,443 INFO ]: Start removeUnreachable. Operand 163 states. [2018-06-25 10:11:08,445 INFO ]: Finished removeUnreachable. Reduced from 163 states to 163 states and 316 transitions. [2018-06-25 10:11:08,445 INFO ]: Start accepts. Automaton has 163 states and 316 transitions. Word has length 21 [2018-06-25 10:11:08,445 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:08,445 INFO ]: Abstraction has 163 states and 316 transitions. [2018-06-25 10:11:08,445 INFO ]: Interpolant automaton has 3 states. [2018-06-25 10:11:08,446 INFO ]: Start isEmpty. Operand 163 states and 316 transitions. [2018-06-25 10:11:08,448 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 10:11:08,448 INFO ]: Found error trace [2018-06-25 10:11:08,448 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:08,448 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:08,448 INFO ]: Analyzing trace with hash -1244291002, now seen corresponding path program 1 times [2018-06-25 10:11:08,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:08,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:08,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:08,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:08,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:08,454 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:08,572 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 10:11:08,572 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:08,572 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:11:08,573 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:11:08,573 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:11:08,573 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:11:08,573 INFO ]: Start difference. First operand 163 states and 316 transitions. Second operand 4 states. [2018-06-25 10:11:08,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:08,747 INFO ]: Finished difference Result 177 states and 338 transitions. [2018-06-25 10:11:08,749 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:11:08,749 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-25 10:11:08,749 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:08,750 INFO ]: With dead ends: 177 [2018-06-25 10:11:08,750 INFO ]: Without dead ends: 160 [2018-06-25 10:11:08,751 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:11:08,751 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-25 10:11:08,757 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-06-25 10:11:08,757 INFO ]: Start removeUnreachable. Operand 160 states. [2018-06-25 10:11:08,759 INFO ]: Finished removeUnreachable. Reduced from 160 states to 160 states and 298 transitions. [2018-06-25 10:11:08,759 INFO ]: Start accepts. Automaton has 160 states and 298 transitions. Word has length 21 [2018-06-25 10:11:08,759 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:08,759 INFO ]: Abstraction has 160 states and 298 transitions. [2018-06-25 10:11:08,759 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:11:08,759 INFO ]: Start isEmpty. Operand 160 states and 298 transitions. [2018-06-25 10:11:08,761 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 10:11:08,761 INFO ]: Found error trace [2018-06-25 10:11:08,761 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:08,761 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:08,762 INFO ]: Analyzing trace with hash 1084822677, now seen corresponding path program 1 times [2018-06-25 10:11:08,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:08,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:08,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:08,763 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:08,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:08,776 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:08,858 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 10:11:08,858 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:11:08,858 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-25 10:11:08,870 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:08,890 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:08,892 INFO ]: Computing forward predicates... [2018-06-25 10:11:08,910 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 10:11:08,934 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:11:08,934 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-25 10:11:08,934 INFO ]: Interpolant automaton has 5 states [2018-06-25 10:11:08,934 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 10:11:08,934 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:11:08,935 INFO ]: Start difference. First operand 160 states and 298 transitions. Second operand 5 states. [2018-06-25 10:11:09,032 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:09,032 INFO ]: Finished difference Result 207 states and 429 transitions. [2018-06-25 10:11:09,032 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 10:11:09,033 INFO ]: Start accepts. Automaton has 5 states. Word has length 22 [2018-06-25 10:11:09,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:09,034 INFO ]: With dead ends: 207 [2018-06-25 10:11:09,034 INFO ]: Without dead ends: 207 [2018-06-25 10:11:09,035 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 10:11:09,035 INFO ]: Start minimizeSevpa. Operand 207 states. [2018-06-25 10:11:09,048 INFO ]: Finished minimizeSevpa. Reduced states from 207 to 173. [2018-06-25 10:11:09,048 INFO ]: Start removeUnreachable. Operand 173 states. [2018-06-25 10:11:09,049 INFO ]: Finished removeUnreachable. Reduced from 173 states to 173 states and 328 transitions. [2018-06-25 10:11:09,049 INFO ]: Start accepts. Automaton has 173 states and 328 transitions. Word has length 22 [2018-06-25 10:11:09,049 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:09,049 INFO ]: Abstraction has 173 states and 328 transitions. [2018-06-25 10:11:09,049 INFO ]: Interpolant automaton has 5 states. [2018-06-25 10:11:09,049 INFO ]: Start isEmpty. Operand 173 states and 328 transitions. [2018-06-25 10:11:09,051 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 10:11:09,051 INFO ]: Found error trace [2018-06-25 10:11:09,051 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:09,052 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:09,052 INFO ]: Analyzing trace with hash -508743987, now seen corresponding path program 1 times [2018-06-25 10:11:09,052 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:09,052 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:09,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:09,053 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:09,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:09,060 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:09,108 INFO ]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-25 10:11:09,108 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:09,108 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 10:11:09,108 INFO ]: Interpolant automaton has 3 states [2018-06-25 10:11:09,108 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 10:11:09,109 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:11:09,109 INFO ]: Start difference. First operand 173 states and 328 transitions. Second operand 3 states. [2018-06-25 10:11:09,203 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:09,203 INFO ]: Finished difference Result 175 states and 330 transitions. [2018-06-25 10:11:09,203 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 10:11:09,203 INFO ]: Start accepts. Automaton has 3 states. Word has length 23 [2018-06-25 10:11:09,203 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:09,204 INFO ]: With dead ends: 175 [2018-06-25 10:11:09,204 INFO ]: Without dead ends: 173 [2018-06-25 10:11:09,204 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:11:09,205 INFO ]: Start minimizeSevpa. Operand 173 states. [2018-06-25 10:11:09,213 INFO ]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-06-25 10:11:09,213 INFO ]: Start removeUnreachable. Operand 173 states. [2018-06-25 10:11:09,214 INFO ]: Finished removeUnreachable. Reduced from 173 states to 173 states and 326 transitions. [2018-06-25 10:11:09,214 INFO ]: Start accepts. Automaton has 173 states and 326 transitions. Word has length 23 [2018-06-25 10:11:09,214 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:09,214 INFO ]: Abstraction has 173 states and 326 transitions. [2018-06-25 10:11:09,214 INFO ]: Interpolant automaton has 3 states. [2018-06-25 10:11:09,214 INFO ]: Start isEmpty. Operand 173 states and 326 transitions. [2018-06-25 10:11:09,216 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 10:11:09,216 INFO ]: Found error trace [2018-06-25 10:11:09,217 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:09,217 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:09,217 INFO ]: Analyzing trace with hash -759568205, now seen corresponding path program 1 times [2018-06-25 10:11:09,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:09,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:09,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:09,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:09,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:09,226 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:09,773 WARN ]: Spent 424.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-06-25 10:11:09,824 INFO ]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 10:11:09,824 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:11:09,824 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-25 10:11:09,830 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:09,866 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:09,870 INFO ]: Computing forward predicates... [2018-06-25 10:11:09,999 INFO ]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 10:11:10,028 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:11:10,028 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-06-25 10:11:10,028 INFO ]: Interpolant automaton has 11 states [2018-06-25 10:11:10,028 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 10:11:10,028 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-25 10:11:10,028 INFO ]: Start difference. First operand 173 states and 326 transitions. Second operand 11 states. [2018-06-25 10:11:10,861 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:10,861 INFO ]: Finished difference Result 287 states and 605 transitions. [2018-06-25 10:11:10,861 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 10:11:10,861 INFO ]: Start accepts. Automaton has 11 states. Word has length 23 [2018-06-25 10:11:10,861 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:10,865 INFO ]: With dead ends: 287 [2018-06-25 10:11:10,865 INFO ]: Without dead ends: 283 [2018-06-25 10:11:10,865 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-06-25 10:11:10,865 INFO ]: Start minimizeSevpa. Operand 283 states. [2018-06-25 10:11:10,883 INFO ]: Finished minimizeSevpa. Reduced states from 283 to 207. [2018-06-25 10:11:10,883 INFO ]: Start removeUnreachable. Operand 207 states. [2018-06-25 10:11:10,885 INFO ]: Finished removeUnreachable. Reduced from 207 states to 207 states and 394 transitions. [2018-06-25 10:11:10,885 INFO ]: Start accepts. Automaton has 207 states and 394 transitions. Word has length 23 [2018-06-25 10:11:10,885 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:10,885 INFO ]: Abstraction has 207 states and 394 transitions. [2018-06-25 10:11:10,885 INFO ]: Interpolant automaton has 11 states. [2018-06-25 10:11:10,886 INFO ]: Start isEmpty. Operand 207 states and 394 transitions. [2018-06-25 10:11:10,888 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 10:11:10,888 INFO ]: Found error trace [2018-06-25 10:11:10,888 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:10,888 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:10,888 INFO ]: Analyzing trace with hash 903909823, now seen corresponding path program 1 times [2018-06-25 10:11:10,888 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:10,888 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:10,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:10,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:10,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:10,895 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:10,968 INFO ]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 10:11:10,968 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:10,968 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 10:11:10,968 INFO ]: Interpolant automaton has 5 states [2018-06-25 10:11:10,968 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 10:11:10,968 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:11:10,969 INFO ]: Start difference. First operand 207 states and 394 transitions. Second operand 5 states. [2018-06-25 10:11:11,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:11,672 INFO ]: Finished difference Result 327 states and 793 transitions. [2018-06-25 10:11:11,673 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 10:11:11,673 INFO ]: Start accepts. Automaton has 5 states. Word has length 23 [2018-06-25 10:11:11,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:11,677 INFO ]: With dead ends: 327 [2018-06-25 10:11:11,677 INFO ]: Without dead ends: 327 [2018-06-25 10:11:11,677 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 10:11:11,677 INFO ]: Start minimizeSevpa. Operand 327 states. [2018-06-25 10:11:11,704 INFO ]: Finished minimizeSevpa. Reduced states from 327 to 213. [2018-06-25 10:11:11,704 INFO ]: Start removeUnreachable. Operand 213 states. [2018-06-25 10:11:11,706 INFO ]: Finished removeUnreachable. Reduced from 213 states to 213 states and 394 transitions. [2018-06-25 10:11:11,706 INFO ]: Start accepts. Automaton has 213 states and 394 transitions. Word has length 23 [2018-06-25 10:11:11,706 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:11,706 INFO ]: Abstraction has 213 states and 394 transitions. [2018-06-25 10:11:11,706 INFO ]: Interpolant automaton has 5 states. [2018-06-25 10:11:11,706 INFO ]: Start isEmpty. Operand 213 states and 394 transitions. [2018-06-25 10:11:11,709 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 10:11:11,709 INFO ]: Found error trace [2018-06-25 10:11:11,709 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:11,709 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:11,709 INFO ]: Analyzing trace with hash -1066874828, now seen corresponding path program 1 times [2018-06-25 10:11:11,709 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:11,709 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:11,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:11,711 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:11,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:11,725 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:12,129 INFO ]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 10:11:12,129 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:12,129 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-25 10:11:12,129 INFO ]: Interpolant automaton has 7 states [2018-06-25 10:11:12,129 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 10:11:12,129 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 10:11:12,129 INFO ]: Start difference. First operand 213 states and 394 transitions. Second operand 7 states. [2018-06-25 10:11:12,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:12,620 INFO ]: Finished difference Result 297 states and 664 transitions. [2018-06-25 10:11:12,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 10:11:12,620 INFO ]: Start accepts. Automaton has 7 states. Word has length 28 [2018-06-25 10:11:12,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:12,623 INFO ]: With dead ends: 297 [2018-06-25 10:11:12,623 INFO ]: Without dead ends: 297 [2018-06-25 10:11:12,623 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-25 10:11:12,623 INFO ]: Start minimizeSevpa. Operand 297 states. [2018-06-25 10:11:12,641 INFO ]: Finished minimizeSevpa. Reduced states from 297 to 209. [2018-06-25 10:11:12,641 INFO ]: Start removeUnreachable. Operand 209 states. [2018-06-25 10:11:12,643 INFO ]: Finished removeUnreachable. Reduced from 209 states to 209 states and 374 transitions. [2018-06-25 10:11:12,643 INFO ]: Start accepts. Automaton has 209 states and 374 transitions. Word has length 28 [2018-06-25 10:11:12,643 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:12,643 INFO ]: Abstraction has 209 states and 374 transitions. [2018-06-25 10:11:12,643 INFO ]: Interpolant automaton has 7 states. [2018-06-25 10:11:12,643 INFO ]: Start isEmpty. Operand 209 states and 374 transitions. [2018-06-25 10:11:12,646 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 10:11:12,646 INFO ]: Found error trace [2018-06-25 10:11:12,647 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:12,647 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:12,647 INFO ]: Analyzing trace with hash -1403442083, now seen corresponding path program 1 times [2018-06-25 10:11:12,647 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:12,647 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:12,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:12,647 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:12,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:12,657 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:13,097 INFO ]: Checked inductivity of 17 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 10:11:13,097 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:11:13,097 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-25 10:11:13,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:13,129 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:13,133 INFO ]: Computing forward predicates... [2018-06-25 10:11:13,389 INFO ]: Checked inductivity of 17 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 10:11:13,410 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:11:13,410 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-06-25 10:11:13,410 INFO ]: Interpolant automaton has 14 states [2018-06-25 10:11:13,410 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 10:11:13,410 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-25 10:11:13,410 INFO ]: Start difference. First operand 209 states and 374 transitions. Second operand 14 states. [2018-06-25 10:11:14,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:14,855 INFO ]: Finished difference Result 301 states and 638 transitions. [2018-06-25 10:11:14,855 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 10:11:14,855 INFO ]: Start accepts. Automaton has 14 states. Word has length 31 [2018-06-25 10:11:14,855 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:14,857 INFO ]: With dead ends: 301 [2018-06-25 10:11:14,857 INFO ]: Without dead ends: 293 [2018-06-25 10:11:14,858 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-06-25 10:11:14,858 INFO ]: Start minimizeSevpa. Operand 293 states. [2018-06-25 10:11:14,875 INFO ]: Finished minimizeSevpa. Reduced states from 293 to 213. [2018-06-25 10:11:14,875 INFO ]: Start removeUnreachable. Operand 213 states. [2018-06-25 10:11:14,876 INFO ]: Finished removeUnreachable. Reduced from 213 states to 213 states and 387 transitions. [2018-06-25 10:11:14,876 INFO ]: Start accepts. Automaton has 213 states and 387 transitions. Word has length 31 [2018-06-25 10:11:14,877 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:14,877 INFO ]: Abstraction has 213 states and 387 transitions. [2018-06-25 10:11:14,877 INFO ]: Interpolant automaton has 14 states. [2018-06-25 10:11:14,877 INFO ]: Start isEmpty. Operand 213 states and 387 transitions. [2018-06-25 10:11:14,880 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 10:11:14,880 INFO ]: Found error trace [2018-06-25 10:11:14,880 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:14,880 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:14,880 INFO ]: Analyzing trace with hash -1247438747, now seen corresponding path program 1 times [2018-06-25 10:11:14,880 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:14,880 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:14,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:14,882 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:14,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:14,890 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:14,977 INFO ]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 10:11:14,977 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:14,977 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-25 10:11:14,978 INFO ]: Interpolant automaton has 7 states [2018-06-25 10:11:14,978 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 10:11:14,978 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-25 10:11:14,978 INFO ]: Start difference. First operand 213 states and 387 transitions. Second operand 7 states. [2018-06-25 10:11:15,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:15,198 INFO ]: Finished difference Result 245 states and 504 transitions. [2018-06-25 10:11:15,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 10:11:15,198 INFO ]: Start accepts. Automaton has 7 states. Word has length 31 [2018-06-25 10:11:15,198 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:15,201 INFO ]: With dead ends: 245 [2018-06-25 10:11:15,201 INFO ]: Without dead ends: 239 [2018-06-25 10:11:15,201 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-25 10:11:15,201 INFO ]: Start minimizeSevpa. Operand 239 states. [2018-06-25 10:11:15,213 INFO ]: Finished minimizeSevpa. Reduced states from 239 to 210. [2018-06-25 10:11:15,213 INFO ]: Start removeUnreachable. Operand 210 states. [2018-06-25 10:11:15,215 INFO ]: Finished removeUnreachable. Reduced from 210 states to 210 states and 375 transitions. [2018-06-25 10:11:15,215 INFO ]: Start accepts. Automaton has 210 states and 375 transitions. Word has length 31 [2018-06-25 10:11:15,215 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:15,215 INFO ]: Abstraction has 210 states and 375 transitions. [2018-06-25 10:11:15,215 INFO ]: Interpolant automaton has 7 states. [2018-06-25 10:11:15,215 INFO ]: Start isEmpty. Operand 210 states and 375 transitions. [2018-06-25 10:11:15,218 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 10:11:15,218 INFO ]: Found error trace [2018-06-25 10:11:15,218 INFO ]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:15,218 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:15,219 INFO ]: Analyzing trace with hash -1132635262, now seen corresponding path program 1 times [2018-06-25 10:11:15,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:15,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:15,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:15,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:15,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:15,228 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:15,325 INFO ]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 10:11:15,325 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:11:15,325 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:11:15,325 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:11:15,325 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:11:15,326 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:11:15,326 INFO ]: Start difference. First operand 210 states and 375 transitions. Second operand 4 states. [2018-06-25 10:11:15,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:15,346 INFO ]: Finished difference Result 209 states and 365 transitions. [2018-06-25 10:11:15,348 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 10:11:15,348 INFO ]: Start accepts. Automaton has 4 states. Word has length 32 [2018-06-25 10:11:15,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:15,349 INFO ]: With dead ends: 209 [2018-06-25 10:11:15,349 INFO ]: Without dead ends: 201 [2018-06-25 10:11:15,349 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:11:15,349 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-25 10:11:15,357 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 178. [2018-06-25 10:11:15,357 INFO ]: Start removeUnreachable. Operand 178 states. [2018-06-25 10:11:15,358 INFO ]: Finished removeUnreachable. Reduced from 178 states to 178 states and 312 transitions. [2018-06-25 10:11:15,358 INFO ]: Start accepts. Automaton has 178 states and 312 transitions. Word has length 32 [2018-06-25 10:11:15,358 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:15,358 INFO ]: Abstraction has 178 states and 312 transitions. [2018-06-25 10:11:15,358 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:11:15,358 INFO ]: Start isEmpty. Operand 178 states and 312 transitions. [2018-06-25 10:11:15,361 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 10:11:15,361 INFO ]: Found error trace [2018-06-25 10:11:15,361 INFO ]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:11:15,361 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:11:15,361 INFO ]: Analyzing trace with hash -153852129, now seen corresponding path program 1 times [2018-06-25 10:11:15,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:11:15,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:11:15,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:15,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:15,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:11:15,371 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:15,539 INFO ]: Checked inductivity of 31 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 10:11:15,539 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:11:15,539 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-25 10:11:15,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:11:15,582 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:11:15,585 INFO ]: Computing forward predicates... [2018-06-25 10:11:15,703 INFO ]: Checked inductivity of 31 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 10:11:15,722 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:11:15,722 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2018-06-25 10:11:15,722 INFO ]: Interpolant automaton has 14 states [2018-06-25 10:11:15,723 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 10:11:15,723 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-25 10:11:15,723 INFO ]: Start difference. First operand 178 states and 312 transitions. Second operand 14 states. [2018-06-25 10:11:16,275 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:11:16,275 INFO ]: Finished difference Result 223 states and 333 transitions. [2018-06-25 10:11:16,276 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 10:11:16,276 INFO ]: Start accepts. Automaton has 14 states. Word has length 39 [2018-06-25 10:11:16,276 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:11:16,276 INFO ]: With dead ends: 223 [2018-06-25 10:11:16,276 INFO ]: Without dead ends: 0 [2018-06-25 10:11:16,276 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2018-06-25 10:11:16,276 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 10:11:16,276 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 10:11:16,276 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 10:11:16,276 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 10:11:16,276 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-06-25 10:11:16,276 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:11:16,276 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 10:11:16,276 INFO ]: Interpolant automaton has 14 states. [2018-06-25 10:11:16,276 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 10:11:16,276 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 10:11:16,280 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 10:11:16 BoogieIcfgContainer [2018-06-25 10:11:16,280 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 10:11:16,280 INFO ]: Toolchain (without parser) took 14654.95 ms. Allocated memory was 306.2 MB in the beginning and 436.2 MB in the end (delta: 130.0 MB). Free memory was 259.6 MB in the beginning and 404.1 MB in the end (delta: -144.6 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 10:11:16,281 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 10:11:16,281 INFO ]: ChcToBoogie took 64.32 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 256.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 10:11:16,281 INFO ]: Boogie Preprocessor took 35.79 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 255.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 10:11:16,282 INFO ]: RCFGBuilder took 496.70 ms. Allocated memory is still 306.2 MB. Free memory was 255.6 MB in the beginning and 238.5 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 3.6 GB. [2018-06-25 10:11:16,282 INFO ]: TraceAbstraction took 14048.13 ms. Allocated memory was 306.2 MB in the beginning and 436.2 MB in the end (delta: 130.0 MB). Free memory was 238.5 MB in the beginning and 404.1 MB in the end (delta: -165.6 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 10:11:16,286 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.32 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 256.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.79 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 255.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 496.70 ms. Allocated memory is still 306.2 MB. Free memory was 255.6 MB in the beginning and 238.5 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 14048.13 ms. Allocated memory was 306.2 MB in the beginning and 436.2 MB in the end (delta: 130.0 MB). Free memory was 238.5 MB in the beginning and 404.1 MB in the end (delta: -165.6 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. SAFE Result, 13.9s OverallTime, 23 OverallIterations, 4 TraceHistogramMax, 8.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1678 SDtfs, 1979 SDslu, 3344 SDs, 0 SdLazy, 3571 SolverSat, 796 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred 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.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 851 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 567 ConstructedInterpolants, 0 QuantifiedInterpolants, 30081 SizeOfPredicates, 28 NumberOfNonLiveVariables, 754 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 28 InterpolantComputations, 18 PerfectInterpolantSequences, 213/232 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__add-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_10-11-16-298.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__add-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_10-11-16-298.csv Received shutdown request...