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/015-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:28:47,023 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:28:47,025 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:28:47,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:28:47,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:28:47,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:28:47,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:28:47,041 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:28:47,043 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:28:47,043 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:28:47,045 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:28:47,045 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:28:47,046 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:28:47,047 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:28:47,047 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:28:47,051 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:28:47,053 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:28:47,065 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:28:47,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:28:47,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:28:47,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:28:47,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:28:47,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:28:47,071 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:28:47,072 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:28:47,073 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:28:47,074 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:28:47,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:28:47,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:28:47,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:28:47,081 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:28:47,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:28:47,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:28:47,083 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:28:47,083 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:28:47,088 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:47,100 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:28:47,100 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:28:47,100 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:28:47,100 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:28:47,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:28:47,102 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:28:47,102 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:28:47,102 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:28:47,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:28:47,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:28:47,103 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:28:47,103 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:28:47,103 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:28:47,103 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:28:47,103 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:28:47,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:28:47,105 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:28:47,106 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:28:47,106 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:28:47,159 INFO ]: Repository-Root is: /tmp [2018-06-22 01:28:47,176 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:28:47,182 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:28:47,184 INFO ]: Initializing SmtParser... [2018-06-22 01:28:47,184 INFO ]: SmtParser initialized [2018-06-22 01:28:47,185 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/015-horn.smt2 [2018-06-22 01:28:47,186 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:47,271 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/015-horn.smt2 unknown [2018-06-22 01:28:47,442 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/015-horn.smt2 [2018-06-22 01:28:47,447 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:28:47,454 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:28:47,455 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:28:47,455 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:28:47,455 INFO ]: ChcToBoogie initialized [2018-06-22 01:28:47,458 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:28:47" (1/1) ... [2018-06-22 01:28:47,513 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:47 Unit [2018-06-22 01:28:47,513 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:28:47,513 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:28:47,514 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:28:47,514 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:28:47,534 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:47" (1/1) ... [2018-06-22 01:28:47,535 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:47" (1/1) ... [2018-06-22 01:28:47,540 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:47" (1/1) ... [2018-06-22 01:28:47,540 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:47" (1/1) ... [2018-06-22 01:28:47,546 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:47" (1/1) ... [2018-06-22 01:28:47,548 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:47" (1/1) ... [2018-06-22 01:28:47,549 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:47" (1/1) ... [2018-06-22 01:28:47,552 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:28:47,552 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:28:47,553 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:28:47,553 INFO ]: RCFGBuilder initialized [2018-06-22 01:28:47,553 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:47" (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 01:28:47,569 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:28:47,569 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:28:47,569 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:28:47,569 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:28:47,569 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:28:47,569 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 01:28:47,910 INFO ]: Using library mode [2018-06-22 01:28:47,911 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:28:47 BoogieIcfgContainer [2018-06-22 01:28:47,911 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:28:47,912 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:28:47,912 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:28:47,917 INFO ]: TraceAbstraction initialized [2018-06-22 01:28:47,918 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:28:47" (1/3) ... [2018-06-22 01:28:47,919 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266734c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:28:47, skipping insertion in model container [2018-06-22 01:28:47,919 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:47" (2/3) ... [2018-06-22 01:28:47,919 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266734c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:28:47, skipping insertion in model container [2018-06-22 01:28:47,919 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:28:47" (3/3) ... [2018-06-22 01:28:47,922 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:28:47,928 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:28:47,935 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:28:47,973 INFO ]: Using default assertion order modulation [2018-06-22 01:28:47,973 INFO ]: Interprodecural is true [2018-06-22 01:28:47,973 INFO ]: Hoare is false [2018-06-22 01:28:47,973 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:28:47,973 INFO ]: Backedges is TWOTRACK [2018-06-22 01:28:47,973 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:28:47,973 INFO ]: Difference is false [2018-06-22 01:28:47,973 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:28:47,974 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:28:47,995 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:28:48,008 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-22 01:28:48,008 INFO ]: Found error trace [2018-06-22 01:28:48,009 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-22 01:28:48,009 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:48,014 INFO ]: Analyzing trace with hash -1603530992, now seen corresponding path program 1 times [2018-06-22 01:28:48,015 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:48,015 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:48,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:48,046 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:48,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:48,071 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:48,093 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:48,095 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:48,096 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:28:48,097 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:28:48,111 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:28:48,112 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:28:48,114 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-22 01:28:48,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:48,138 INFO ]: Finished difference Result 10 states and 18 transitions. [2018-06-22 01:28:48,138 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:28:48,139 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-22 01:28:48,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:48,149 INFO ]: With dead ends: 10 [2018-06-22 01:28:48,149 INFO ]: Without dead ends: 10 [2018-06-22 01:28:48,151 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:48,165 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:28:48,178 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:28:48,180 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:28:48,180 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-06-22 01:28:48,181 INFO ]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 6 [2018-06-22 01:28:48,181 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:48,181 INFO ]: Abstraction has 10 states and 18 transitions. [2018-06-22 01:28:48,181 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:28:48,181 INFO ]: Start isEmpty. Operand 10 states and 18 transitions. [2018-06-22 01:28:48,182 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:28:48,182 INFO ]: Found error trace [2018-06-22 01:28:48,182 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:48,182 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:48,182 INFO ]: Analyzing trace with hash 1842117200, now seen corresponding path program 1 times [2018-06-22 01:28:48,182 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:48,182 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:48,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:48,183 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:48,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:48,197 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:48,283 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:48,283 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:48,283 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:48,285 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:48,285 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:48,285 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:48,285 INFO ]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2018-06-22 01:28:48,354 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:48,354 INFO ]: Finished difference Result 14 states and 25 transitions. [2018-06-22 01:28:48,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:48,354 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:28:48,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:48,356 INFO ]: With dead ends: 14 [2018-06-22 01:28:48,356 INFO ]: Without dead ends: 14 [2018-06-22 01:28:48,357 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:48,357 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:28:48,360 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-22 01:28:48,360 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:28:48,360 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2018-06-22 01:28:48,360 INFO ]: Start accepts. Automaton has 11 states and 20 transitions. Word has length 7 [2018-06-22 01:28:48,361 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:48,361 INFO ]: Abstraction has 11 states and 20 transitions. [2018-06-22 01:28:48,361 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:48,361 INFO ]: Start isEmpty. Operand 11 states and 20 transitions. [2018-06-22 01:28:48,361 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:28:48,361 INFO ]: Found error trace [2018-06-22 01:28:48,361 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:48,361 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:48,361 INFO ]: Analyzing trace with hash 1832881990, now seen corresponding path program 1 times [2018-06-22 01:28:48,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:48,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:48,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:48,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:48,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:48,375 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:48,435 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:48,435 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:48,435 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:48,436 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:48,436 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:48,436 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:48,436 INFO ]: Start difference. First operand 11 states and 20 transitions. Second operand 3 states. [2018-06-22 01:28:48,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:48,554 INFO ]: Finished difference Result 16 states and 32 transitions. [2018-06-22 01:28:48,554 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:48,554 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:28:48,554 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:48,555 INFO ]: With dead ends: 16 [2018-06-22 01:28:48,555 INFO ]: Without dead ends: 16 [2018-06-22 01:28:48,555 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:48,555 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:28:48,557 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-22 01:28:48,557 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:28:48,557 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-06-22 01:28:48,557 INFO ]: Start accepts. Automaton has 12 states and 25 transitions. Word has length 7 [2018-06-22 01:28:48,558 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:48,558 INFO ]: Abstraction has 12 states and 25 transitions. [2018-06-22 01:28:48,558 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:48,558 INFO ]: Start isEmpty. Operand 12 states and 25 transitions. [2018-06-22 01:28:48,559 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:28:48,559 INFO ]: Found error trace [2018-06-22 01:28:48,559 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:48,559 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:48,559 INFO ]: Analyzing trace with hash 1260834457, now seen corresponding path program 1 times [2018-06-22 01:28:48,559 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:48,559 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:48,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:48,560 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:48,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:48,567 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:48,592 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:48,592 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:48,592 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:48,593 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:48,593 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:48,593 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:48,593 INFO ]: Start difference. First operand 12 states and 25 transitions. Second operand 3 states. [2018-06-22 01:28:48,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:48,616 INFO ]: Finished difference Result 13 states and 26 transitions. [2018-06-22 01:28:48,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:48,616 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:28:48,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:48,617 INFO ]: With dead ends: 13 [2018-06-22 01:28:48,617 INFO ]: Without dead ends: 11 [2018-06-22 01:28:48,617 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:48,617 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:28:48,619 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:28:48,619 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:28:48,619 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-22 01:28:48,619 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-22 01:28:48,619 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:48,619 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-22 01:28:48,619 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:48,619 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-22 01:28:48,620 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:28:48,620 INFO ]: Found error trace [2018-06-22 01:28:48,620 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:48,620 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:48,620 INFO ]: Analyzing trace with hash 978564732, now seen corresponding path program 1 times [2018-06-22 01:28:48,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:48,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:48,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:48,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:48,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:48,632 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:48,662 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:48,662 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:48,662 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:48,662 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:48,663 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:48,663 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:48,663 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. [2018-06-22 01:28:48,698 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:48,698 INFO ]: Finished difference Result 10 states and 13 transitions. [2018-06-22 01:28:48,699 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:48,699 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:28:48,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:48,700 INFO ]: With dead ends: 10 [2018-06-22 01:28:48,700 INFO ]: Without dead ends: 10 [2018-06-22 01:28:48,700 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:48,700 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:28:48,701 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:28:48,701 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:28:48,701 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-22 01:28:48,701 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 8 [2018-06-22 01:28:48,702 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:48,702 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-22 01:28:48,702 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:48,702 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-22 01:28:48,702 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:28:48,702 INFO ]: Found error trace [2018-06-22 01:28:48,702 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:48,702 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:48,702 INFO ]: Analyzing trace with hash 967154779, now seen corresponding path program 1 times [2018-06-22 01:28:48,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:48,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:48,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:48,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:48,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:48,722 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:48,802 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:48,802 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:48,802 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:48,802 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:48,802 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:48,802 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:48,802 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 3 states. [2018-06-22 01:28:48,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:48,825 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-22 01:28:48,825 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:48,825 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:28:48,825 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:48,826 INFO ]: With dead ends: 9 [2018-06-22 01:28:48,826 INFO ]: Without dead ends: 9 [2018-06-22 01:28:48,826 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:48,826 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 01:28:48,827 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 01:28:48,827 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:28:48,827 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-22 01:28:48,827 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2018-06-22 01:28:48,827 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:48,827 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-22 01:28:48,827 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:48,827 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-22 01:28:48,828 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:28:48,828 INFO ]: Found error trace [2018-06-22 01:28:48,828 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:48,828 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:48,828 INFO ]: Analyzing trace with hash 982884427, now seen corresponding path program 1 times [2018-06-22 01:28:48,828 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:48,828 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:48,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:48,828 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:48,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:48,847 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:48,941 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:48,941 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:48,941 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:48,950 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:48,982 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:48,992 INFO ]: Computing forward predicates... [2018-06-22 01:28:49,095 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:28:49,114 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:28:49,115 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-22 01:28:49,115 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:28:49,115 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:28:49,115 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:28:49,115 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-06-22 01:28:49,189 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:49,189 INFO ]: Finished difference Result 5 states and 5 transitions. [2018-06-22 01:28:49,189 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:49,189 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 01:28:49,189 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:49,189 INFO ]: With dead ends: 5 [2018-06-22 01:28:49,189 INFO ]: Without dead ends: 0 [2018-06-22 01:28:49,190 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:28:49,190 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:28:49,190 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:28:49,190 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:28:49,190 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:28:49,190 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2018-06-22 01:28:49,190 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:49,190 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:28:49,190 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:28:49,190 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:28:49,190 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:28:49,194 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:28:49 BoogieIcfgContainer [2018-06-22 01:28:49,194 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:28:49,195 INFO ]: Toolchain (without parser) took 1747.14 ms. Allocated memory is still 307.2 MB. Free memory was 260.6 MB in the beginning and 199.9 MB in the end (delta: 60.7 MB). Peak memory consumption was 60.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:28:49,196 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:28:49,196 INFO ]: ChcToBoogie took 58.16 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 257.6 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:49,197 INFO ]: Boogie Preprocessor took 38.51 ms. Allocated memory is still 307.2 MB. Free memory was 257.6 MB in the beginning and 256.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:28:49,197 INFO ]: RCFGBuilder took 358.36 ms. Allocated memory is still 307.2 MB. Free memory was 256.5 MB in the beginning and 245.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:28:49,197 INFO ]: TraceAbstraction took 1281.81 ms. Allocated memory is still 307.2 MB. Free memory was 245.5 MB in the beginning and 199.9 MB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 3.6 GB. [2018-06-22 01:28:49,200 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 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.16 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 257.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 38.51 ms. Allocated memory is still 307.2 MB. Free memory was 257.6 MB in the beginning and 256.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 358.36 ms. Allocated memory is still 307.2 MB. Free memory was 256.5 MB in the beginning and 245.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 1281.81 ms. Allocated memory is still 307.2 MB. Free memory was 245.5 MB in the beginning and 199.9 MB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 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 2 procedures, 12 locations, 1 error locations. SAFE Result, 1.2s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 83 SDtfs, 21 SDslu, 48 SDs, 0 SdLazy, 26 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s 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, 7 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 800 SizeOfPredicates, 4 NumberOfNonLiveVariables, 62 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 1/2 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/015-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-28-49-214.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/015-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-28-49-214.csv Received shutdown request...