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/Consistency/ch-triangle-location-nr.6.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 00:33:15,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 00:33:15,259 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 00:33:15,272 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 00:33:15,273 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 00:33:15,274 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 00:33:15,277 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 00:33:15,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 00:33:15,281 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 00:33:15,283 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 00:33:15,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 00:33:15,284 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 00:33:15,285 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 00:33:15,286 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 00:33:15,287 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 00:33:15,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 00:33:15,293 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 00:33:15,306 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 00:33:15,307 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 00:33:15,308 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 00:33:15,310 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 00:33:15,312 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 00:33:15,312 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 00:33:15,312 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 00:33:15,313 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 00:33:15,318 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 00:33:15,319 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 00:33:15,319 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 00:33:15,320 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 00:33:15,320 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 00:33:15,326 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 00:33:15,327 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 00:33:15,327 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 00:33:15,328 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 00:33:15,328 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 00:33:15,329 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 00:33:15,349 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 00:33:15,349 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 00:33:15,349 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 00:33:15,350 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 00:33:15,351 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 00:33:15,351 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 00:33:15,351 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 00:33:15,351 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 00:33:15,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:33:15,351 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 00:33:15,352 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 00:33:15,352 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 00:33:15,352 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 00:33:15,352 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 00:33:15,352 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 00:33:15,352 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 00:33:15,353 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 00:33:15,354 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 00:33:15,354 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 00:33:15,393 INFO ]: Repository-Root is: /tmp [2018-06-22 00:33:15,409 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 00:33:15,413 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 00:33:15,415 INFO ]: Initializing SmtParser... [2018-06-22 00:33:15,415 INFO ]: SmtParser initialized [2018-06-22 00:33:15,416 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/ch-triangle-location-nr.6.smt2 [2018-06-22 00:33:15,417 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 00:33:15,505 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/ch-triangle-location-nr.6.smt2 unknown [2018-06-22 00:33:15,917 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/ch-triangle-location-nr.6.smt2 [2018-06-22 00:33:15,921 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 00:33:15,931 INFO ]: Walking toolchain with 4 elements. [2018-06-22 00:33:15,932 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 00:33:15,932 INFO ]: Initializing ChcToBoogie... [2018-06-22 00:33:15,932 INFO ]: ChcToBoogie initialized [2018-06-22 00:33:15,938 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:33:15" (1/1) ... [2018-06-22 00:33:16,032 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:33:16 Unit [2018-06-22 00:33:16,032 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 00:33:16,033 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 00:33:16,033 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 00:33:16,033 INFO ]: Boogie Preprocessor initialized [2018-06-22 00:33:16,054 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:33:16" (1/1) ... [2018-06-22 00:33:16,055 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:33:16" (1/1) ... [2018-06-22 00:33:16,071 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:33:16" (1/1) ... [2018-06-22 00:33:16,071 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:33:16" (1/1) ... [2018-06-22 00:33:16,085 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:33:16" (1/1) ... [2018-06-22 00:33:16,090 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:33:16" (1/1) ... [2018-06-22 00:33:16,094 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:33:16" (1/1) ... [2018-06-22 00:33:16,098 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 00:33:16,098 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 00:33:16,098 INFO ]: Initializing RCFGBuilder... [2018-06-22 00:33:16,099 INFO ]: RCFGBuilder initialized [2018-06-22 00:33:16,099 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:33:16" (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 00:33:16,112 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 00:33:16,112 INFO ]: Found specification of procedure gotoProc [2018-06-22 00:33:16,112 INFO ]: Found implementation of procedure gotoProc [2018-06-22 00:33:16,112 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 00:33:16,112 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 00:33:16,112 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 00:33:17,330 INFO ]: Using library mode [2018-06-22 00:33:17,330 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:33:17 BoogieIcfgContainer [2018-06-22 00:33:17,330 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 00:33:17,332 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 00:33:17,332 INFO ]: Initializing TraceAbstraction... [2018-06-22 00:33:17,335 INFO ]: TraceAbstraction initialized [2018-06-22 00:33:17,335 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:33:15" (1/3) ... [2018-06-22 00:33:17,336 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d11290e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:33:17, skipping insertion in model container [2018-06-22 00:33:17,336 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:33:16" (2/3) ... [2018-06-22 00:33:17,336 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d11290e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:33:17, skipping insertion in model container [2018-06-22 00:33:17,336 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:33:17" (3/3) ... [2018-06-22 00:33:17,338 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 00:33:17,347 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 00:33:17,357 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 00:33:17,410 INFO ]: Using default assertion order modulation [2018-06-22 00:33:17,411 INFO ]: Interprodecural is true [2018-06-22 00:33:17,411 INFO ]: Hoare is false [2018-06-22 00:33:17,411 INFO ]: Compute interpolants for FPandBP [2018-06-22 00:33:17,411 INFO ]: Backedges is TWOTRACK [2018-06-22 00:33:17,411 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 00:33:17,411 INFO ]: Difference is false [2018-06-22 00:33:17,411 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 00:33:17,411 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 00:33:17,436 INFO ]: Start isEmpty. Operand 147 states. [2018-06-22 00:33:17,455 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 00:33:17,455 INFO ]: Found error trace [2018-06-22 00:33:17,456 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:33:17,456 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:33:17,461 INFO ]: Analyzing trace with hash 128720807, now seen corresponding path program 1 times [2018-06-22 00:33:17,463 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:33:17,463 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:33:17,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:33:17,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:33:17,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:33:17,544 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:33:17,697 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:33:17,698 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:33:17,699 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 00:33:17,700 INFO ]: Interpolant automaton has 4 states [2018-06-22 00:33:17,712 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 00:33:17,712 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 00:33:17,716 INFO ]: Start difference. First operand 147 states. Second operand 4 states. [2018-06-22 00:33:20,378 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:33:20,378 INFO ]: Finished difference Result 287 states and 567 transitions. [2018-06-22 00:33:20,379 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 00:33:20,380 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 00:33:20,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:33:20,428 INFO ]: With dead ends: 287 [2018-06-22 00:33:20,428 INFO ]: Without dead ends: 285 [2018-06-22 00:33:20,430 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 00:33:20,455 INFO ]: Start minimizeSevpa. Operand 285 states. [2018-06-22 00:33:20,588 INFO ]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-06-22 00:33:20,590 INFO ]: Start removeUnreachable. Operand 285 states. [2018-06-22 00:33:20,621 INFO ]: Finished removeUnreachable. Reduced from 285 states to 285 states and 565 transitions. [2018-06-22 00:33:20,622 INFO ]: Start accepts. Automaton has 285 states and 565 transitions. Word has length 8 [2018-06-22 00:33:20,623 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:33:20,623 INFO ]: Abstraction has 285 states and 565 transitions. [2018-06-22 00:33:20,623 INFO ]: Interpolant automaton has 4 states. [2018-06-22 00:33:20,623 INFO ]: Start isEmpty. Operand 285 states and 565 transitions. [2018-06-22 00:33:20,629 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 00:33:20,629 INFO ]: Found error trace [2018-06-22 00:33:20,629 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:33:20,629 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:33:20,629 INFO ]: Analyzing trace with hash -324115626, now seen corresponding path program 1 times [2018-06-22 00:33:20,629 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:33:20,629 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:33:20,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:33:20,630 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:33:20,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:33:20,638 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:33:20,784 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:33:20,784 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:33:20,784 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 00:33:20,786 INFO ]: Interpolant automaton has 4 states [2018-06-22 00:33:20,786 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 00:33:20,786 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 00:33:20,786 INFO ]: Start difference. First operand 285 states and 565 transitions. Second operand 4 states. [2018-06-22 00:33:23,281 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:33:23,282 INFO ]: Finished difference Result 426 states and 846 transitions. [2018-06-22 00:33:23,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 00:33:23,282 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 00:33:23,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:33:23,306 INFO ]: With dead ends: 426 [2018-06-22 00:33:23,307 INFO ]: Without dead ends: 426 [2018-06-22 00:33:23,307 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 00:33:23,308 INFO ]: Start minimizeSevpa. Operand 426 states. [2018-06-22 00:33:23,417 INFO ]: Finished minimizeSevpa. Reduced states from 426 to 426. [2018-06-22 00:33:23,417 INFO ]: Start removeUnreachable. Operand 426 states. [2018-06-22 00:33:23,433 INFO ]: Finished removeUnreachable. Reduced from 426 states to 426 states and 846 transitions. [2018-06-22 00:33:23,433 INFO ]: Start accepts. Automaton has 426 states and 846 transitions. Word has length 9 [2018-06-22 00:33:23,433 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:33:23,433 INFO ]: Abstraction has 426 states and 846 transitions. [2018-06-22 00:33:23,433 INFO ]: Interpolant automaton has 4 states. [2018-06-22 00:33:23,433 INFO ]: Start isEmpty. Operand 426 states and 846 transitions. [2018-06-22 00:33:23,436 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 00:33:23,436 INFO ]: Found error trace [2018-06-22 00:33:23,436 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:33:23,436 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:33:23,437 INFO ]: Analyzing trace with hash -389685617, now seen corresponding path program 1 times [2018-06-22 00:33:23,437 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:33:23,437 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:33:23,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:33:23,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:33:23,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:33:23,448 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:33:23,506 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:33:23,506 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:33:23,506 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 00:33:23,506 INFO ]: Interpolant automaton has 4 states [2018-06-22 00:33:23,507 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 00:33:23,507 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 00:33:23,507 INFO ]: Start difference. First operand 426 states and 846 transitions. Second operand 4 states. [2018-06-22 00:33:24,481 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:33:24,481 INFO ]: Finished difference Result 567 states and 1127 transitions. [2018-06-22 00:33:24,481 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 00:33:24,481 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 00:33:24,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:33:24,513 INFO ]: With dead ends: 567 [2018-06-22 00:33:24,513 INFO ]: Without dead ends: 567 [2018-06-22 00:33:24,514 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 00:33:24,514 INFO ]: Start minimizeSevpa. Operand 567 states. [2018-06-22 00:33:24,613 INFO ]: Finished minimizeSevpa. Reduced states from 567 to 567. [2018-06-22 00:33:24,614 INFO ]: Start removeUnreachable. Operand 567 states. [2018-06-22 00:33:24,628 INFO ]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1127 transitions. [2018-06-22 00:33:24,628 INFO ]: Start accepts. Automaton has 567 states and 1127 transitions. Word has length 9 [2018-06-22 00:33:24,628 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:33:24,629 INFO ]: Abstraction has 567 states and 1127 transitions. [2018-06-22 00:33:24,629 INFO ]: Interpolant automaton has 4 states. [2018-06-22 00:33:24,629 INFO ]: Start isEmpty. Operand 567 states and 1127 transitions. [2018-06-22 00:33:24,633 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 00:33:24,633 INFO ]: Found error trace [2018-06-22 00:33:24,633 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:33:24,633 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:33:24,633 INFO ]: Analyzing trace with hash 1492864011, now seen corresponding path program 1 times [2018-06-22 00:33:24,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:33:24,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:33:24,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:33:24,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:33:24,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:33:24,645 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:33:24,719 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:33:24,719 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:33:24,719 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 00:33:24,719 INFO ]: Interpolant automaton has 4 states [2018-06-22 00:33:24,719 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 00:33:24,719 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 00:33:24,720 INFO ]: Start difference. First operand 567 states and 1127 transitions. Second operand 4 states. [2018-06-22 00:33:27,094 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:33:27,094 INFO ]: Finished difference Result 707 states and 1407 transitions. [2018-06-22 00:33:27,094 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 00:33:27,094 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 00:33:27,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:33:27,109 INFO ]: With dead ends: 707 [2018-06-22 00:33:27,110 INFO ]: Without dead ends: 707 [2018-06-22 00:33:27,110 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 00:33:27,110 INFO ]: Start minimizeSevpa. Operand 707 states. [2018-06-22 00:33:27,196 INFO ]: Finished minimizeSevpa. Reduced states from 707 to 707. [2018-06-22 00:33:27,196 INFO ]: Start removeUnreachable. Operand 707 states. [2018-06-22 00:33:27,215 INFO ]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1407 transitions. [2018-06-22 00:33:27,216 INFO ]: Start accepts. Automaton has 707 states and 1407 transitions. Word has length 11 [2018-06-22 00:33:27,216 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:33:27,216 INFO ]: Abstraction has 707 states and 1407 transitions. [2018-06-22 00:33:27,216 INFO ]: Interpolant automaton has 4 states. [2018-06-22 00:33:27,216 INFO ]: Start isEmpty. Operand 707 states and 1407 transitions. [2018-06-22 00:33:27,254 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 00:33:27,254 INFO ]: Found error trace [2018-06-22 00:33:27,254 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:33:27,254 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:33:27,254 INFO ]: Analyzing trace with hash -1902480790, now seen corresponding path program 1 times [2018-06-22 00:33:27,254 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:33:27,254 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:33:27,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:33:27,255 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:33:27,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:33:27,279 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:33:27,452 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:33:27,452 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:33:27,452 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 00:33:27,453 INFO ]: Interpolant automaton has 8 states [2018-06-22 00:33:27,453 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 00:33:27,453 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 00:33:27,453 INFO ]: Start difference. First operand 707 states and 1407 transitions. Second operand 8 states. [2018-06-22 00:33:33,531 WARN ]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 00:33:41,831 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:33:41,831 INFO ]: Finished difference Result 2220 states and 14508 transitions. [2018-06-22 00:33:41,832 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 00:33:41,832 INFO ]: Start accepts. Automaton has 8 states. Word has length 20 [2018-06-22 00:33:41,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:33:42,628 INFO ]: With dead ends: 2220 [2018-06-22 00:33:42,628 INFO ]: Without dead ends: 2205 [2018-06-22 00:33:42,628 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2018-06-22 00:33:42,630 INFO ]: Start minimizeSevpa. Operand 2205 states. [2018-06-22 00:33:44,140 INFO ]: Finished minimizeSevpa. Reduced states from 2205 to 1214. [2018-06-22 00:33:44,140 INFO ]: Start removeUnreachable. Operand 1214 states. [2018-06-22 00:33:44,201 INFO ]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3167 transitions. [2018-06-22 00:33:44,201 INFO ]: Start accepts. Automaton has 1214 states and 3167 transitions. Word has length 20 [2018-06-22 00:33:44,201 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:33:44,201 INFO ]: Abstraction has 1214 states and 3167 transitions. [2018-06-22 00:33:44,201 INFO ]: Interpolant automaton has 8 states. [2018-06-22 00:33:44,201 INFO ]: Start isEmpty. Operand 1214 states and 3167 transitions. [2018-06-22 00:33:44,235 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 00:33:44,235 INFO ]: Found error trace [2018-06-22 00:33:44,235 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:33:44,235 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:33:44,236 INFO ]: Analyzing trace with hash -58819185, now seen corresponding path program 1 times [2018-06-22 00:33:44,236 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:33:44,236 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:33:44,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:33:44,237 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:33:44,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:33:44,279 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:33:44,493 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:33:44,493 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:33:44,493 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 00:33:44,494 INFO ]: Interpolant automaton has 8 states [2018-06-22 00:33:44,494 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 00:33:44,494 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 00:33:44,494 INFO ]: Start difference. First operand 1214 states and 3167 transitions. Second operand 8 states. [2018-06-22 00:34:01,591 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:34:01,591 INFO ]: Finished difference Result 4205 states and 44855 transitions. [2018-06-22 00:34:01,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 00:34:01,591 INFO ]: Start accepts. Automaton has 8 states. Word has length 20 [2018-06-22 00:34:01,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:34:05,051 INFO ]: With dead ends: 4205 [2018-06-22 00:34:05,051 INFO ]: Without dead ends: 4180 [2018-06-22 00:34:05,052 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2018-06-22 00:34:05,053 INFO ]: Start minimizeSevpa. Operand 4180 states. [2018-06-22 00:34:08,802 INFO ]: Finished minimizeSevpa. Reduced states from 4180 to 2515. [2018-06-22 00:34:08,802 INFO ]: Start removeUnreachable. Operand 2515 states. [2018-06-22 00:34:09,039 INFO ]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 9534 transitions. [2018-06-22 00:34:09,040 INFO ]: Start accepts. Automaton has 2515 states and 9534 transitions. Word has length 20 [2018-06-22 00:34:09,040 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:34:09,040 INFO ]: Abstraction has 2515 states and 9534 transitions. [2018-06-22 00:34:09,040 INFO ]: Interpolant automaton has 8 states. [2018-06-22 00:34:09,040 INFO ]: Start isEmpty. Operand 2515 states and 9534 transitions. [2018-06-22 00:34:09,091 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 00:34:09,091 INFO ]: Found error trace [2018-06-22 00:34:09,091 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:34:09,092 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:34:09,093 INFO ]: Analyzing trace with hash -1186215278, now seen corresponding path program 1 times [2018-06-22 00:34:09,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:34:09,093 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:34:09,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:34:09,094 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:34:09,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:34:09,114 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:34:09,432 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:34:09,432 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:34:09,432 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 00:34:09,432 INFO ]: Interpolant automaton has 8 states [2018-06-22 00:34:09,432 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 00:34:09,432 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 00:34:09,433 INFO ]: Start difference. First operand 2515 states and 9534 transitions. Second operand 8 states. Received shutdown request... [2018-06-22 00:34:14,901 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 00:34:14,901 WARN ]: Verification canceled [2018-06-22 00:34:14,906 WARN ]: Timeout [2018-06-22 00:34:14,906 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:34:14 BoogieIcfgContainer [2018-06-22 00:34:14,906 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 00:34:14,907 INFO ]: Toolchain (without parser) took 58985.15 ms. Allocated memory was 308.8 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 251.2 MB in the beginning and 350.2 MB in the end (delta: -99.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. [2018-06-22 00:34:14,908 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 00:34:14,908 INFO ]: ChcToBoogie took 100.88 ms. Allocated memory is still 308.8 MB. Free memory was 251.2 MB in the beginning and 249.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:34:14,908 INFO ]: Boogie Preprocessor took 64.96 ms. Allocated memory is still 308.8 MB. Free memory was 249.2 MB in the beginning and 247.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:34:14,912 INFO ]: RCFGBuilder took 1231.89 ms. Allocated memory was 308.8 MB in the beginning and 325.1 MB in the end (delta: 16.3 MB). Free memory was 245.2 MB in the beginning and 287.1 MB in the end (delta: -41.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 3.6 GB. [2018-06-22 00:34:14,912 INFO ]: TraceAbstraction took 57574.08 ms. Allocated memory was 325.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 287.1 MB in the beginning and 350.2 MB in the end (delta: -63.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. [2018-06-22 00:34:14,919 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 100.88 ms. Allocated memory is still 308.8 MB. Free memory was 251.2 MB in the beginning and 249.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 64.96 ms. Allocated memory is still 308.8 MB. Free memory was 249.2 MB in the beginning and 247.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1231.89 ms. Allocated memory was 308.8 MB in the beginning and 325.1 MB in the end (delta: 16.3 MB). Free memory was 245.2 MB in the beginning and 287.1 MB in the end (delta: -41.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57574.08 ms. Allocated memory was 325.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 287.1 MB in the beginning and 350.2 MB in the end (delta: -63.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (2515states) and interpolant automaton (currently 24 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2755 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 147 locations, 1 error locations. TIMEOUT Result, 57.5s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 49.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4055 SDtfs, 1656 SDslu, 9426 SDs, 0 SdLazy, 28259 SolverSat, 8376 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2515occurred in iteration=6, 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: 6.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 2656 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 3606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ch-triangle-location-nr.6.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_00-34-14-930.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ch-triangle-location-nr.6.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_00-34-14-930.csv Completed graceful shutdown