java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/015b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:17:13,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:17:13,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:17:13,267 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:17:13,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:17:13,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:17:13,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:17:13,275 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:17:13,276 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:17:13,277 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:17:13,278 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:17:13,278 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:17:13,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:17:13,285 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:17:13,285 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:17:13,286 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:17:13,288 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:17:13,290 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:17:13,292 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:17:13,293 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:17:13,294 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:17:13,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:17:13,297 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:17:13,297 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:17:13,298 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:17:13,299 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:17:13,300 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:17:13,300 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:17:13,301 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:17:13,302 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:17:13,302 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:17:13,303 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:17:13,303 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:17:13,304 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:17:13,305 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:17:13,305 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:17:13,318 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:17:13,319 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:17:13,319 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:17:13,319 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:17:13,320 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:17:13,320 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:17:13,321 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:17:13,321 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:17:13,321 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:17:13,321 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:17:13,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:17:13,322 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:17:13,322 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:17:13,322 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:17:13,322 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:17:13,323 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:17:13,323 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:17:13,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:17:13,323 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:17:13,325 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:17:13,325 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:17:13,369 INFO ]: Repository-Root is: /tmp [2018-06-22 11:17:13,386 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:17:13,391 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:17:13,393 INFO ]: Initializing SmtParser... [2018-06-22 11:17:13,393 INFO ]: SmtParser initialized [2018-06-22 11:17:13,394 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/015b-horn.smt2 [2018-06-22 11:17:13,395 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:17:13,486 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/015b-horn.smt2 unknown [2018-06-22 11:17:13,701 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/015b-horn.smt2 [2018-06-22 11:17:13,715 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:17:13,721 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:17:13,721 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:17:13,721 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:17:13,721 INFO ]: ChcToBoogie initialized [2018-06-22 11:17:13,726 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:17:13" (1/1) ... [2018-06-22 11:17:13,772 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:13 Unit [2018-06-22 11:17:13,772 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:17:13,772 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:17:13,773 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:17:13,773 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:17:13,795 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:13" (1/1) ... [2018-06-22 11:17:13,795 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:13" (1/1) ... [2018-06-22 11:17:13,802 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:13" (1/1) ... [2018-06-22 11:17:13,803 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:13" (1/1) ... [2018-06-22 11:17:13,807 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:13" (1/1) ... [2018-06-22 11:17:13,809 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:13" (1/1) ... [2018-06-22 11:17:13,812 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:13" (1/1) ... [2018-06-22 11:17:13,814 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:17:13,814 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:17:13,814 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:17:13,815 INFO ]: RCFGBuilder initialized [2018-06-22 11:17:13,821 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:13" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:17:13,835 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:17:13,835 INFO ]: Found specification of procedure False [2018-06-22 11:17:13,835 INFO ]: Found implementation of procedure False [2018-06-22 11:17:13,835 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:17:13,835 INFO ]: Found specification of procedure REC__f [2018-06-22 11:17:13,835 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:17:13,835 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:17:13,835 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:17:13,835 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:17:13,835 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:17:13,835 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:17:13,835 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:17:13,835 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:17:13,835 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:17:13,835 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:17:14,254 INFO ]: Using library mode [2018-06-22 11:17:14,254 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:17:14 BoogieIcfgContainer [2018-06-22 11:17:14,254 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:17:14,256 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:17:14,256 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:17:14,259 INFO ]: TraceAbstraction initialized [2018-06-22 11:17:14,259 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:17:13" (1/3) ... [2018-06-22 11:17:14,260 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2a55bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:17:14, skipping insertion in model container [2018-06-22 11:17:14,260 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:13" (2/3) ... [2018-06-22 11:17:14,260 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2a55bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:17:14, skipping insertion in model container [2018-06-22 11:17:14,260 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:17:14" (3/3) ... [2018-06-22 11:17:14,262 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:17:14,273 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:17:14,280 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:17:14,314 INFO ]: Using default assertion order modulation [2018-06-22 11:17:14,314 INFO ]: Interprodecural is true [2018-06-22 11:17:14,314 INFO ]: Hoare is false [2018-06-22 11:17:14,314 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:17:14,315 INFO ]: Backedges is TWOTRACK [2018-06-22 11:17:14,315 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:17:14,315 INFO ]: Difference is false [2018-06-22 11:17:14,315 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:17:14,315 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:17:14,340 INFO ]: Start isEmpty. Operand 30 states. [2018-06-22 11:17:14,354 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:17:14,354 INFO ]: Found error trace [2018-06-22 11:17:14,355 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:17:14,355 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:14,359 INFO ]: Analyzing trace with hash 115984119, now seen corresponding path program 1 times [2018-06-22 11:17:14,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:14,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:14,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:14,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:14,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:14,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:14,432 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:14,435 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:14,436 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:17:14,437 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:17:14,450 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:17:14,450 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:17:14,453 INFO ]: Start difference. First operand 30 states. Second operand 2 states. [2018-06-22 11:17:14,479 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:14,480 INFO ]: Finished difference Result 25 states and 40 transitions. [2018-06-22 11:17:14,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:17:14,482 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:17:14,482 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:14,498 INFO ]: With dead ends: 25 [2018-06-22 11:17:14,498 INFO ]: Without dead ends: 25 [2018-06-22 11:17:14,502 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:17:14,519 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:17:14,544 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 11:17:14,545 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:17:14,547 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2018-06-22 11:17:14,548 INFO ]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 5 [2018-06-22 11:17:14,548 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:14,548 INFO ]: Abstraction has 25 states and 40 transitions. [2018-06-22 11:17:14,548 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:17:14,548 INFO ]: Start isEmpty. Operand 25 states and 40 transitions. [2018-06-22 11:17:14,550 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:17:14,550 INFO ]: Found error trace [2018-06-22 11:17:14,550 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:14,551 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:14,551 INFO ]: Analyzing trace with hash 1283474471, now seen corresponding path program 1 times [2018-06-22 11:17:14,551 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:14,551 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:14,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:14,552 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:14,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:14,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:14,635 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:14,635 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:14,635 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:14,637 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:14,637 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:14,637 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:14,637 INFO ]: Start difference. First operand 25 states and 40 transitions. Second operand 4 states. [2018-06-22 11:17:14,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:14,747 INFO ]: Finished difference Result 29 states and 46 transitions. [2018-06-22 11:17:14,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:14,748 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:17:14,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:14,749 INFO ]: With dead ends: 29 [2018-06-22 11:17:14,749 INFO ]: Without dead ends: 29 [2018-06-22 11:17:14,750 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:14,750 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:17:14,759 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 11:17:14,760 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:17:14,761 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 44 transitions. [2018-06-22 11:17:14,761 INFO ]: Start accepts. Automaton has 27 states and 44 transitions. Word has length 9 [2018-06-22 11:17:14,762 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:14,762 INFO ]: Abstraction has 27 states and 44 transitions. [2018-06-22 11:17:14,762 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:14,762 INFO ]: Start isEmpty. Operand 27 states and 44 transitions. [2018-06-22 11:17:14,763 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:17:14,763 INFO ]: Found error trace [2018-06-22 11:17:14,763 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:14,763 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:14,763 INFO ]: Analyzing trace with hash -928456940, now seen corresponding path program 1 times [2018-06-22 11:17:14,763 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:14,763 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:14,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:14,764 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:14,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:14,774 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:14,847 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:14,847 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:14,847 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:14,848 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:14,848 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:14,848 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:14,848 INFO ]: Start difference. First operand 27 states and 44 transitions. Second operand 4 states. [2018-06-22 11:17:14,947 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:14,947 INFO ]: Finished difference Result 31 states and 49 transitions. [2018-06-22 11:17:14,948 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:14,948 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:17:14,948 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:14,949 INFO ]: With dead ends: 31 [2018-06-22 11:17:14,949 INFO ]: Without dead ends: 31 [2018-06-22 11:17:14,949 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:14,950 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:17:14,957 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:17:14,957 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:17:14,958 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2018-06-22 11:17:14,958 INFO ]: Start accepts. Automaton has 29 states and 47 transitions. Word has length 9 [2018-06-22 11:17:14,959 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:14,959 INFO ]: Abstraction has 29 states and 47 transitions. [2018-06-22 11:17:14,959 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:14,959 INFO ]: Start isEmpty. Operand 29 states and 47 transitions. [2018-06-22 11:17:14,960 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:14,960 INFO ]: Found error trace [2018-06-22 11:17:14,960 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:14,960 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:14,960 INFO ]: Analyzing trace with hash 2068540746, now seen corresponding path program 1 times [2018-06-22 11:17:14,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:14,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:14,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:14,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:14,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:14,969 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:15,005 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:15,005 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:15,005 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:15,005 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:15,005 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:15,005 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:15,005 INFO ]: Start difference. First operand 29 states and 47 transitions. Second operand 4 states. [2018-06-22 11:17:15,193 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:15,193 INFO ]: Finished difference Result 35 states and 54 transitions. [2018-06-22 11:17:15,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:15,194 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:17:15,194 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:15,195 INFO ]: With dead ends: 35 [2018-06-22 11:17:15,195 INFO ]: Without dead ends: 35 [2018-06-22 11:17:15,195 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:15,196 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:17:15,203 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:17:15,203 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:17:15,205 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2018-06-22 11:17:15,205 INFO ]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 13 [2018-06-22 11:17:15,205 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:15,205 INFO ]: Abstraction has 33 states and 52 transitions. [2018-06-22 11:17:15,205 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:15,205 INFO ]: Start isEmpty. Operand 33 states and 52 transitions. [2018-06-22 11:17:15,206 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:15,206 INFO ]: Found error trace [2018-06-22 11:17:15,206 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:15,206 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:15,206 INFO ]: Analyzing trace with hash 1555021277, now seen corresponding path program 1 times [2018-06-22 11:17:15,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:15,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:15,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,207 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:15,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,217 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:15,264 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:15,264 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:15,264 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:15,264 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:15,264 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:15,264 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:15,264 INFO ]: Start difference. First operand 33 states and 52 transitions. Second operand 4 states. [2018-06-22 11:17:15,412 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:15,412 INFO ]: Finished difference Result 35 states and 56 transitions. [2018-06-22 11:17:15,412 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:15,412 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:17:15,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:15,413 INFO ]: With dead ends: 35 [2018-06-22 11:17:15,413 INFO ]: Without dead ends: 35 [2018-06-22 11:17:15,413 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:15,413 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:17:15,419 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 11:17:15,419 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:17:15,420 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2018-06-22 11:17:15,420 INFO ]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 13 [2018-06-22 11:17:15,420 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:15,420 INFO ]: Abstraction has 35 states and 56 transitions. [2018-06-22 11:17:15,421 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:15,421 INFO ]: Start isEmpty. Operand 35 states and 56 transitions. [2018-06-22 11:17:15,422 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:15,422 INFO ]: Found error trace [2018-06-22 11:17:15,422 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:15,422 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:15,422 INFO ]: Analyzing trace with hash -153491459, now seen corresponding path program 1 times [2018-06-22 11:17:15,422 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:15,422 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:15,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,423 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:15,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,431 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:15,507 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:15,507 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:15,507 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:15,507 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:15,507 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:15,507 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:15,507 INFO ]: Start difference. First operand 35 states and 56 transitions. Second operand 4 states. [2018-06-22 11:17:15,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:15,590 INFO ]: Finished difference Result 41 states and 62 transitions. [2018-06-22 11:17:15,590 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:15,590 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:17:15,590 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:15,591 INFO ]: With dead ends: 41 [2018-06-22 11:17:15,591 INFO ]: Without dead ends: 41 [2018-06-22 11:17:15,591 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:15,591 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:17:15,597 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 35. [2018-06-22 11:17:15,597 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:17:15,598 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2018-06-22 11:17:15,598 INFO ]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 13 [2018-06-22 11:17:15,598 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:15,598 INFO ]: Abstraction has 35 states and 56 transitions. [2018-06-22 11:17:15,599 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:15,599 INFO ]: Start isEmpty. Operand 35 states and 56 transitions. [2018-06-22 11:17:15,600 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:15,600 INFO ]: Found error trace [2018-06-22 11:17:15,600 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:15,600 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:15,600 INFO ]: Analyzing trace with hash -1735924844, now seen corresponding path program 1 times [2018-06-22 11:17:15,600 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:15,600 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:15,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,601 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:15,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,609 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:15,643 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:15,643 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:15,643 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:15,643 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:15,643 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:15,643 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:15,643 INFO ]: Start difference. First operand 35 states and 56 transitions. Second operand 4 states. [2018-06-22 11:17:15,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:15,699 INFO ]: Finished difference Result 41 states and 64 transitions. [2018-06-22 11:17:15,699 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:15,699 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:17:15,699 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:15,702 INFO ]: With dead ends: 41 [2018-06-22 11:17:15,702 INFO ]: Without dead ends: 41 [2018-06-22 11:17:15,703 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:15,703 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:17:15,722 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 35. [2018-06-22 11:17:15,722 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:17:15,723 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2018-06-22 11:17:15,723 INFO ]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 13 [2018-06-22 11:17:15,723 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:15,724 INFO ]: Abstraction has 35 states and 56 transitions. [2018-06-22 11:17:15,724 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:15,724 INFO ]: Start isEmpty. Operand 35 states and 56 transitions. [2018-06-22 11:17:15,725 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:15,725 INFO ]: Found error trace [2018-06-22 11:17:15,725 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:15,725 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:15,725 INFO ]: Analyzing trace with hash 235606104, now seen corresponding path program 1 times [2018-06-22 11:17:15,725 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:15,725 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:15,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,726 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:15,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,746 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:15,973 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:15,973 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:15,973 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:15,985 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:16,012 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:16,025 INFO ]: Computing forward predicates... [2018-06-22 11:17:16,574 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:16,606 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:16,606 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:17:16,606 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:17:16,606 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:17:16,606 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:17:16,607 INFO ]: Start difference. First operand 35 states and 56 transitions. Second operand 10 states. [2018-06-22 11:17:16,751 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:16,751 INFO ]: Finished difference Result 43 states and 64 transitions. [2018-06-22 11:17:16,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:17:16,751 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:17:16,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:16,752 INFO ]: With dead ends: 43 [2018-06-22 11:17:16,752 INFO ]: Without dead ends: 43 [2018-06-22 11:17:16,752 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:17:16,752 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:17:16,761 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-06-22 11:17:16,761 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:17:16,765 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 58 transitions. [2018-06-22 11:17:16,765 INFO ]: Start accepts. Automaton has 37 states and 58 transitions. Word has length 13 [2018-06-22 11:17:16,765 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:16,765 INFO ]: Abstraction has 37 states and 58 transitions. [2018-06-22 11:17:16,765 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:17:16,765 INFO ]: Start isEmpty. Operand 37 states and 58 transitions. [2018-06-22 11:17:16,766 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:16,766 INFO ]: Found error trace [2018-06-22 11:17:16,766 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:16,766 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:16,766 INFO ]: Analyzing trace with hash 457839194, now seen corresponding path program 1 times [2018-06-22 11:17:16,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:16,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:16,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:16,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:16,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:16,772 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:16,803 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:16,803 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:16,803 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:16,803 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:16,803 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:16,803 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:16,803 INFO ]: Start difference. First operand 37 states and 58 transitions. Second operand 4 states. [2018-06-22 11:17:16,846 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:16,846 INFO ]: Finished difference Result 37 states and 57 transitions. [2018-06-22 11:17:16,846 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:16,846 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:17:16,846 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:16,847 INFO ]: With dead ends: 37 [2018-06-22 11:17:16,847 INFO ]: Without dead ends: 34 [2018-06-22 11:17:16,847 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:16,847 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:17:16,851 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 11:17:16,851 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:17:16,852 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions. [2018-06-22 11:17:16,852 INFO ]: Start accepts. Automaton has 34 states and 52 transitions. Word has length 13 [2018-06-22 11:17:16,852 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:16,852 INFO ]: Abstraction has 34 states and 52 transitions. [2018-06-22 11:17:16,852 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:16,852 INFO ]: Start isEmpty. Operand 34 states and 52 transitions. [2018-06-22 11:17:16,853 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:16,853 INFO ]: Found error trace [2018-06-22 11:17:16,853 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:16,853 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:16,853 INFO ]: Analyzing trace with hash 99679361, now seen corresponding path program 1 times [2018-06-22 11:17:16,853 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:16,853 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:16,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:16,854 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:16,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:16,862 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:16,906 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:16,906 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:16,906 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:17:16,906 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:17:16,907 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:17:16,907 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:17:16,907 INFO ]: Start difference. First operand 34 states and 52 transitions. Second operand 5 states. [2018-06-22 11:17:16,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:16,997 INFO ]: Finished difference Result 42 states and 60 transitions. [2018-06-22 11:17:16,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:17:16,997 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:17:16,997 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:16,998 INFO ]: With dead ends: 42 [2018-06-22 11:17:16,998 INFO ]: Without dead ends: 33 [2018-06-22 11:17:16,998 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:17:16,998 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:17:17,002 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-06-22 11:17:17,002 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:17:17,003 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2018-06-22 11:17:17,003 INFO ]: Start accepts. Automaton has 29 states and 44 transitions. Word has length 17 [2018-06-22 11:17:17,003 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:17,003 INFO ]: Abstraction has 29 states and 44 transitions. [2018-06-22 11:17:17,003 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:17:17,003 INFO ]: Start isEmpty. Operand 29 states and 44 transitions. [2018-06-22 11:17:17,003 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:17,003 INFO ]: Found error trace [2018-06-22 11:17:17,004 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:17,004 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:17,004 INFO ]: Analyzing trace with hash -200380840, now seen corresponding path program 1 times [2018-06-22 11:17:17,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:17,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:17,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:17,004 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:17,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:17,012 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:17,059 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:17,059 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:17,059 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:17:17,060 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:17:17,060 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:17:17,060 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:17:17,060 INFO ]: Start difference. First operand 29 states and 44 transitions. Second operand 5 states. [2018-06-22 11:17:17,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:17,110 INFO ]: Finished difference Result 37 states and 54 transitions. [2018-06-22 11:17:17,111 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:17:17,111 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:17:17,111 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:17,112 INFO ]: With dead ends: 37 [2018-06-22 11:17:17,112 INFO ]: Without dead ends: 32 [2018-06-22 11:17:17,112 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:17:17,112 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:17:17,115 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-22 11:17:17,115 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:17:17,116 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-06-22 11:17:17,116 INFO ]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-06-22 11:17:17,116 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:17,116 INFO ]: Abstraction has 30 states and 43 transitions. [2018-06-22 11:17:17,116 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:17:17,116 INFO ]: Start isEmpty. Operand 30 states and 43 transitions. [2018-06-22 11:17:17,117 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:17,117 INFO ]: Found error trace [2018-06-22 11:17:17,117 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:17,117 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:17,117 INFO ]: Analyzing trace with hash 360282652, now seen corresponding path program 2 times [2018-06-22 11:17:17,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:17,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:17,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:17,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:17,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:17,128 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:17,326 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:17,326 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:17,326 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:17,341 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:17:17,385 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:17,385 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:17,388 INFO ]: Computing forward predicates... [2018-06-22 11:17:18,104 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:18,122 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:18,122 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:17:18,122 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:17:18,122 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:17:18,122 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:17:18,123 INFO ]: Start difference. First operand 30 states and 43 transitions. Second operand 14 states. [2018-06-22 11:17:18,645 WARN ]: Spent 168.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2018-06-22 11:17:19,025 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:19,025 INFO ]: Finished difference Result 36 states and 49 transitions. [2018-06-22 11:17:19,025 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:17:19,025 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 11:17:19,025 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:19,026 INFO ]: With dead ends: 36 [2018-06-22 11:17:19,026 INFO ]: Without dead ends: 28 [2018-06-22 11:17:19,026 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:17:19,026 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:17:19,029 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-06-22 11:17:19,029 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:17:19,029 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-06-22 11:17:19,030 INFO ]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 17 [2018-06-22 11:17:19,030 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:19,030 INFO ]: Abstraction has 26 states and 38 transitions. [2018-06-22 11:17:19,030 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:17:19,030 INFO ]: Start isEmpty. Operand 26 states and 38 transitions. [2018-06-22 11:17:19,030 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:19,030 INFO ]: Found error trace [2018-06-22 11:17:19,030 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:19,030 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:19,030 INFO ]: Analyzing trace with hash -224905473, now seen corresponding path program 1 times [2018-06-22 11:17:19,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:19,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:19,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:19,031 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:19,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:19,043 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:19,082 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:19,082 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:19,082 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:19,082 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:19,082 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:19,082 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:19,083 INFO ]: Start difference. First operand 26 states and 38 transitions. Second operand 4 states. [2018-06-22 11:17:19,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:19,118 INFO ]: Finished difference Result 14 states and 20 transitions. [2018-06-22 11:17:19,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:19,119 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:17:19,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:19,119 INFO ]: With dead ends: 14 [2018-06-22 11:17:19,119 INFO ]: Without dead ends: 0 [2018-06-22 11:17:19,119 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:19,119 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:17:19,119 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:17:19,119 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:17:19,120 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:17:19,120 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-22 11:17:19,120 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:19,120 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:17:19,120 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:19,120 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:17:19,120 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:17:19,124 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:17:19 BoogieIcfgContainer [2018-06-22 11:17:19,124 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:17:19,125 INFO ]: Toolchain (without parser) took 5408.85 ms. Allocated memory was 308.8 MB in the beginning and 337.6 MB in the end (delta: 28.8 MB). Free memory was 264.3 MB in the beginning and 255.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 38.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:19,125 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:17:19,126 INFO ]: ChcToBoogie took 51.03 ms. Allocated memory is still 308.8 MB. Free memory was 263.3 MB in the beginning and 261.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:19,126 INFO ]: Boogie Preprocessor took 41.34 ms. Allocated memory is still 308.8 MB. Free memory was 261.3 MB in the beginning and 260.3 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-22 11:17:19,127 INFO ]: RCFGBuilder took 440.02 ms. Allocated memory is still 308.8 MB. Free memory was 260.3 MB in the beginning and 249.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:19,127 INFO ]: TraceAbstraction took 4868.27 ms. Allocated memory was 308.8 MB in the beginning and 337.6 MB in the end (delta: 28.8 MB). Free memory was 249.3 MB in the beginning and 255.0 MB in the end (delta: -5.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:19,130 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 51.03 ms. Allocated memory is still 308.8 MB. Free memory was 263.3 MB in the beginning and 261.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 41.34 ms. Allocated memory is still 308.8 MB. Free memory was 261.3 MB in the beginning and 260.3 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 440.02 ms. Allocated memory is still 308.8 MB. Free memory was 260.3 MB in the beginning and 249.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4868.27 ms. Allocated memory was 308.8 MB in the beginning and 337.6 MB in the end (delta: 28.8 MB). Free memory was 249.3 MB in the beginning and 255.0 MB in the end (delta: -5.6 MB). Peak memory consumption was 23.2 MB. 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 5 procedures, 30 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 478 SDtfs, 37 SDslu, 1024 SDs, 0 SdLazy, 401 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 32 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 184 ConstructedInterpolants, 4 QuantifiedInterpolants, 13524 SizeOfPredicates, 24 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 20/38 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/015b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-17-19-141.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/015b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-17-19-141.csv Received shutdown request...