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_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/014-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:28:41,375 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:28:41,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:28:41,392 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:28:41,393 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:28:41,394 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:28:41,395 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:28:41,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:28:41,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:28:41,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:28:41,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:28:41,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:28:41,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:28:41,404 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:28:41,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:28:41,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:28:41,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:28:41,412 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:28:41,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:28:41,415 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:28:41,416 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:28:41,418 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:28:41,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:28:41,418 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:28:41,419 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:28:41,420 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:28:41,420 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:28:41,421 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:28:41,422 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:28:41,422 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:28:41,423 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:28:41,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:28:41,424 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:28:41,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:28:41,425 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:28:41,425 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:28:41,442 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:28:41,443 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:28:41,447 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:28:41,448 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:28:41,449 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:28:41,449 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:28:41,449 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:28:41,449 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:28:41,449 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:28:41,450 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:28:41,450 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:28:41,450 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:28:41,450 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:28:41,450 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:28:41,451 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:28:41,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:28:41,451 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:28:41,453 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:28:41,453 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:28:41,499 INFO ]: Repository-Root is: /tmp [2018-06-22 01:28:41,515 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:28:41,523 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:28:41,524 INFO ]: Initializing SmtParser... [2018-06-22 01:28:41,525 INFO ]: SmtParser initialized [2018-06-22 01:28:41,525 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/014-horn.smt2 [2018-06-22 01:28:41,527 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 01:28:41,613 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014-horn.smt2 unknown [2018-06-22 01:28:41,826 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014-horn.smt2 [2018-06-22 01:28:41,831 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:28:41,837 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:28:41,838 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:28:41,838 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:28:41,838 INFO ]: ChcToBoogie initialized [2018-06-22 01:28:41,844 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:28:41" (1/1) ... [2018-06-22 01:28:41,899 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:41 Unit [2018-06-22 01:28:41,899 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:28:41,900 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:28:41,900 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:28:41,900 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:28:41,917 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:41" (1/1) ... [2018-06-22 01:28:41,917 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:41" (1/1) ... [2018-06-22 01:28:41,921 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:41" (1/1) ... [2018-06-22 01:28:41,922 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:41" (1/1) ... [2018-06-22 01:28:41,924 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:41" (1/1) ... [2018-06-22 01:28:41,926 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:41" (1/1) ... [2018-06-22 01:28:41,927 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:41" (1/1) ... [2018-06-22 01:28:41,929 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:28:41,929 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:28:41,930 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:28:41,930 INFO ]: RCFGBuilder initialized [2018-06-22 01:28:41,930 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:41" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:28:41,942 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:28:41,942 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:28:41,942 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:28:41,942 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:28:41,942 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:28:41,942 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:28:42,221 INFO ]: Using library mode [2018-06-22 01:28:42,222 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:28:42 BoogieIcfgContainer [2018-06-22 01:28:42,222 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:28:42,225 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:28:42,226 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:28:42,229 INFO ]: TraceAbstraction initialized [2018-06-22 01:28:42,230 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:28:41" (1/3) ... [2018-06-22 01:28:42,231 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127d2874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:28:42, skipping insertion in model container [2018-06-22 01:28:42,231 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:41" (2/3) ... [2018-06-22 01:28:42,231 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127d2874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:28:42, skipping insertion in model container [2018-06-22 01:28:42,231 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:28:42" (3/3) ... [2018-06-22 01:28:42,233 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:28:42,243 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:28:42,252 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:28:42,287 INFO ]: Using default assertion order modulation [2018-06-22 01:28:42,288 INFO ]: Interprodecural is true [2018-06-22 01:28:42,288 INFO ]: Hoare is false [2018-06-22 01:28:42,288 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:28:42,288 INFO ]: Backedges is TWOTRACK [2018-06-22 01:28:42,288 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:28:42,288 INFO ]: Difference is false [2018-06-22 01:28:42,288 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:28:42,288 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:28:42,301 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:28:42,311 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-22 01:28:42,311 INFO ]: Found error trace [2018-06-22 01:28:42,312 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-22 01:28:42,312 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:42,317 INFO ]: Analyzing trace with hash 2118833424, now seen corresponding path program 1 times [2018-06-22 01:28:42,318 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:42,318 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:42,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:42,353 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:42,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:42,381 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:42,418 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:42,420 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:42,420 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:28:42,422 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:28:42,437 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:28:42,438 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:28:42,441 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-22 01:28:42,479 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:42,479 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-22 01:28:42,479 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:28:42,480 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-22 01:28:42,480 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:42,491 INFO ]: With dead ends: 10 [2018-06-22 01:28:42,491 INFO ]: Without dead ends: 10 [2018-06-22 01:28:42,492 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 01:28:42,506 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:28:42,519 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:28:42,520 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:28:42,521 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-22 01:28:42,522 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 6 [2018-06-22 01:28:42,522 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:42,522 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-22 01:28:42,522 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:28:42,522 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-22 01:28:42,522 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:28:42,522 INFO ]: Found error trace [2018-06-22 01:28:42,522 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:42,523 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:42,523 INFO ]: Analyzing trace with hash 1255120571, now seen corresponding path program 1 times [2018-06-22 01:28:42,523 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:42,523 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:42,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:42,525 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:42,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:42,540 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:42,608 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:42,608 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:42,608 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:42,609 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:42,609 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:42,609 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:42,610 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 3 states. [2018-06-22 01:28:42,726 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:42,726 INFO ]: Finished difference Result 14 states and 21 transitions. [2018-06-22 01:28:42,727 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:42,727 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:28:42,727 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:42,730 INFO ]: With dead ends: 14 [2018-06-22 01:28:42,730 INFO ]: Without dead ends: 14 [2018-06-22 01:28:42,731 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-22 01:28:42,731 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:28:42,734 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-22 01:28:42,734 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:28:42,734 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-22 01:28:42,735 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 7 [2018-06-22 01:28:42,735 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:42,735 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-22 01:28:42,735 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:42,735 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-22 01:28:42,735 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:28:42,735 INFO ]: Found error trace [2018-06-22 01:28:42,735 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:42,735 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:42,735 INFO ]: Analyzing trace with hash 1261853337, now seen corresponding path program 1 times [2018-06-22 01:28:42,735 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:42,735 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:42,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:42,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:42,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:42,751 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:42,880 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:42,880 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:42,880 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:42,880 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:42,881 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:42,881 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:42,881 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. [2018-06-22 01:28:42,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:42,935 INFO ]: Finished difference Result 12 states and 18 transitions. [2018-06-22 01:28:42,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:42,936 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:28:42,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:42,937 INFO ]: With dead ends: 12 [2018-06-22 01:28:42,937 INFO ]: Without dead ends: 12 [2018-06-22 01:28:42,937 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-22 01:28:42,937 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:28:42,940 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:28:42,940 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:28:42,941 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-06-22 01:28:42,941 INFO ]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 7 [2018-06-22 01:28:42,941 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:42,941 INFO ]: Abstraction has 12 states and 18 transitions. [2018-06-22 01:28:42,941 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:42,941 INFO ]: Start isEmpty. Operand 12 states and 18 transitions. [2018-06-22 01:28:42,942 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:28:42,942 INFO ]: Found error trace [2018-06-22 01:28:42,942 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:42,942 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:42,942 INFO ]: Analyzing trace with hash 249825904, now seen corresponding path program 1 times [2018-06-22 01:28:42,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:42,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:42,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:42,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:42,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:42,965 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:43,032 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:43,032 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:43,032 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 01:28:43,039 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:43,079 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:43,088 INFO ]: Computing forward predicates... [2018-06-22 01:28:43,116 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:43,136 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:43,136 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:28:43,136 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:28:43,137 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:28:43,137 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:28:43,137 INFO ]: Start difference. First operand 12 states and 18 transitions. Second operand 4 states. [2018-06-22 01:28:43,180 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:43,180 INFO ]: Finished difference Result 14 states and 18 transitions. [2018-06-22 01:28:43,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:43,181 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:28:43,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:43,181 INFO ]: With dead ends: 14 [2018-06-22 01:28:43,181 INFO ]: Without dead ends: 14 [2018-06-22 01:28:43,181 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:28:43,182 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:28:43,183 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-06-22 01:28:43,183 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:28:43,183 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-22 01:28:43,183 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-06-22 01:28:43,184 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:43,184 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-22 01:28:43,184 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:28:43,184 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-22 01:28:43,184 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:28:43,184 INFO ]: Found error trace [2018-06-22 01:28:43,184 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:43,184 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:43,184 INFO ]: Analyzing trace with hash 256558670, now seen corresponding path program 1 times [2018-06-22 01:28:43,184 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:43,184 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:43,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:43,185 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:43,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:43,199 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:43,343 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:28:43,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 01:28:43,432 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:43,432 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:28:43,433 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:28:43,433 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:28:43,433 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:28:43,433 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 4 states. [2018-06-22 01:28:43,642 WARN ]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 01:28:43,739 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:43,739 INFO ]: Finished difference Result 15 states and 19 transitions. [2018-06-22 01:28:43,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:28:43,740 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:28:43,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:43,740 INFO ]: With dead ends: 15 [2018-06-22 01:28:43,740 INFO ]: Without dead ends: 15 [2018-06-22 01:28:43,741 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:28:43,741 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:28:43,743 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-22 01:28:43,743 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:28:43,743 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-06-22 01:28:43,743 INFO ]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2018-06-22 01:28:43,744 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:43,744 INFO ]: Abstraction has 11 states and 14 transitions. [2018-06-22 01:28:43,744 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:28:43,744 INFO ]: Start isEmpty. Operand 11 states and 14 transitions. [2018-06-22 01:28:43,744 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:28:43,744 INFO ]: Found error trace [2018-06-22 01:28:43,744 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:43,744 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:43,744 INFO ]: Analyzing trace with hash 463427374, now seen corresponding path program 1 times [2018-06-22 01:28:43,744 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:43,744 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:43,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:43,745 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:43,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:43,754 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:43,779 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:43,779 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:43,779 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:43,779 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:43,779 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:43,780 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:43,780 INFO ]: Start difference. First operand 11 states and 14 transitions. Second operand 3 states. [2018-06-22 01:28:43,787 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:43,787 INFO ]: Finished difference Result 12 states and 14 transitions. [2018-06-22 01:28:43,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:43,788 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:28:43,788 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:43,788 INFO ]: With dead ends: 12 [2018-06-22 01:28:43,788 INFO ]: Without dead ends: 11 [2018-06-22 01:28:43,788 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-22 01:28:43,788 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:28:43,789 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:28:43,789 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:28:43,789 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-22 01:28:43,789 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2018-06-22 01:28:43,789 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:43,790 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-22 01:28:43,790 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:43,790 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-22 01:28:43,790 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:28:43,790 INFO ]: Found error trace [2018-06-22 01:28:43,790 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:43,790 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:43,790 INFO ]: Analyzing trace with hash -842804935, now seen corresponding path program 1 times [2018-06-22 01:28:43,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:43,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:43,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:43,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:43,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:43,817 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:43,944 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:43,944 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:43,944 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 01:28:43,951 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:43,985 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:43,987 INFO ]: Computing forward predicates... [2018-06-22 01:28:44,222 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:44,241 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:44,241 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 01:28:44,242 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:28:44,242 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:28:44,242 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:28:44,242 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 8 states. [2018-06-22 01:28:44,394 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:44,394 INFO ]: Finished difference Result 12 states and 14 transitions. [2018-06-22 01:28:44,395 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:28:44,396 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-22 01:28:44,396 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:44,396 INFO ]: With dead ends: 12 [2018-06-22 01:28:44,396 INFO ]: Without dead ends: 12 [2018-06-22 01:28:44,396 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:28:44,396 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:28:44,397 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-22 01:28:44,397 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:28:44,398 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-06-22 01:28:44,398 INFO ]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2018-06-22 01:28:44,398 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:44,398 INFO ]: Abstraction has 10 states and 11 transitions. [2018-06-22 01:28:44,398 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:28:44,398 INFO ]: Start isEmpty. Operand 10 states and 11 transitions. [2018-06-22 01:28:44,398 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:28:44,398 INFO ]: Found error trace [2018-06-22 01:28:44,398 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:44,398 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:44,398 INFO ]: Analyzing trace with hash -635936231, now seen corresponding path program 1 times [2018-06-22 01:28:44,399 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:44,399 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:44,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:44,399 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:44,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:44,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:44,433 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:44,433 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:44,433 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:28:44,433 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:28:44,433 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:28:44,433 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:28:44,434 INFO ]: Start difference. First operand 10 states and 11 transitions. Second operand 4 states. [2018-06-22 01:28:44,442 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:44,442 INFO ]: Finished difference Result 5 states and 5 transitions. [2018-06-22 01:28:44,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:28:44,442 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:28:44,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:44,442 INFO ]: With dead ends: 5 [2018-06-22 01:28:44,442 INFO ]: Without dead ends: 0 [2018-06-22 01:28:44,443 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-22 01:28:44,443 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:28:44,443 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:28:44,443 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:28:44,443 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:28:44,443 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2018-06-22 01:28:44,443 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:44,443 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:28:44,443 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:28:44,443 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:28:44,443 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:28:44,447 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:28:44 BoogieIcfgContainer [2018-06-22 01:28:44,447 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:28:44,448 INFO ]: Toolchain (without parser) took 2616.63 ms. Allocated memory was 309.3 MB in the beginning and 325.6 MB in the end (delta: 16.3 MB). Free memory was 262.7 MB in the beginning and 281.5 MB in the end (delta: -18.8 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:28:44,449 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:28:44,449 INFO ]: ChcToBoogie took 61.97 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:28:44,450 INFO ]: Boogie Preprocessor took 28.82 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 259.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 01:28:44,450 INFO ]: RCFGBuilder took 292.73 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 250.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:28:44,451 INFO ]: TraceAbstraction took 2221.81 ms. Allocated memory was 309.3 MB in the beginning and 325.6 MB in the end (delta: 16.3 MB). Free memory was 250.6 MB in the beginning and 281.5 MB in the end (delta: -30.9 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:28:44,454 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.97 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 28.82 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 259.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 292.73 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 250.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2221.81 ms. Allocated memory was 309.3 MB in the beginning and 325.6 MB in the end (delta: 16.3 MB). Free memory was 250.6 MB in the beginning and 281.5 MB in the end (delta: -30.9 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, 12 locations, 1 error locations. SAFE Result, 2.1s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 88 SDtfs, 26 SDslu, 83 SDs, 0 SdLazy, 35 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, 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.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 1338 SizeOfPredicates, 7 NumberOfNonLiveVariables, 129 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 2/6 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/014-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-28-44-465.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-28-44-465.csv Received shutdown request...