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/fortune-full-nonrobust.22.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 00:39:27,423 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 00:39:27,426 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 00:39:27,443 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 00:39:27,443 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 00:39:27,444 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 00:39:27,445 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 00:39:27,448 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 00:39:27,449 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 00:39:27,451 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 00:39:27,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 00:39:27,452 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 00:39:27,453 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 00:39:27,454 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 00:39:27,455 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 00:39:27,458 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 00:39:27,460 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 00:39:27,469 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 00:39:27,471 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 00:39:27,471 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 00:39:27,472 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 00:39:27,477 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 00:39:27,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 00:39:27,478 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 00:39:27,479 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 00:39:27,479 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 00:39:27,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 00:39:27,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 00:39:27,483 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 00:39:27,483 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 00:39:27,483 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 00:39:27,488 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 00:39:27,488 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 00:39:27,489 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 00:39:27,490 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 00:39:27,490 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:39:27,510 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 00:39:27,510 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 00:39:27,510 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 00:39:27,511 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 00:39:27,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 00:39:27,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 00:39:27,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 00:39:27,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 00:39:27,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:39:27,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 00:39:27,513 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 00:39:27,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 00:39:27,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 00:39:27,514 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 00:39:27,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 00:39:27,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 00:39:27,514 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 00:39:27,515 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 00:39:27,515 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 00:39:27,562 INFO ]: Repository-Root is: /tmp [2018-06-22 00:39:27,577 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 00:39:27,581 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 00:39:27,584 INFO ]: Initializing SmtParser... [2018-06-22 00:39:27,584 INFO ]: SmtParser initialized [2018-06-22 00:39:27,585 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.22.smt2 [2018-06-22 00:39:27,586 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:39:27,670 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.22.smt2 unknown [2018-06-22 00:39:28,346 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.22.smt2 [2018-06-22 00:39:28,352 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 00:39:28,358 INFO ]: Walking toolchain with 4 elements. [2018-06-22 00:39:28,359 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 00:39:28,359 INFO ]: Initializing ChcToBoogie... [2018-06-22 00:39:28,359 INFO ]: ChcToBoogie initialized [2018-06-22 00:39:28,362 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:39:28" (1/1) ... [2018-06-22 00:39:28,513 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:39:28 Unit [2018-06-22 00:39:28,514 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 00:39:28,514 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 00:39:28,514 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 00:39:28,514 INFO ]: Boogie Preprocessor initialized [2018-06-22 00:39:28,538 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:39:28" (1/1) ... [2018-06-22 00:39:28,538 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:39:28" (1/1) ... [2018-06-22 00:39:28,556 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:39:28" (1/1) ... [2018-06-22 00:39:28,556 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:39:28" (1/1) ... [2018-06-22 00:39:28,583 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:39:28" (1/1) ... [2018-06-22 00:39:28,587 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:39:28" (1/1) ... [2018-06-22 00:39:28,592 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:39:28" (1/1) ... [2018-06-22 00:39:28,598 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 00:39:28,598 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 00:39:28,598 INFO ]: Initializing RCFGBuilder... [2018-06-22 00:39:28,598 INFO ]: RCFGBuilder initialized [2018-06-22 00:39:28,599 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:39:28" (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:39:28,614 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 00:39:28,614 INFO ]: Found specification of procedure gotoProc [2018-06-22 00:39:28,614 INFO ]: Found implementation of procedure gotoProc [2018-06-22 00:39:28,614 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 00:39:28,614 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 00:39:28,614 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:39:30,985 INFO ]: Using library mode [2018-06-22 00:39:30,986 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:39:30 BoogieIcfgContainer [2018-06-22 00:39:31,064 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 00:39:31,065 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 00:39:31,065 INFO ]: Initializing TraceAbstraction... [2018-06-22 00:39:31,068 INFO ]: TraceAbstraction initialized [2018-06-22 00:39:31,068 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:39:28" (1/3) ... [2018-06-22 00:39:31,069 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed2586e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:39:31, skipping insertion in model container [2018-06-22 00:39:31,069 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:39:28" (2/3) ... [2018-06-22 00:39:31,070 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed2586e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:39:31, skipping insertion in model container [2018-06-22 00:39:31,070 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:39:30" (3/3) ... [2018-06-22 00:39:31,071 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 00:39:31,080 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 00:39:31,089 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 00:39:31,147 INFO ]: Using default assertion order modulation [2018-06-22 00:39:31,148 INFO ]: Interprodecural is true [2018-06-22 00:39:31,148 INFO ]: Hoare is false [2018-06-22 00:39:31,148 INFO ]: Compute interpolants for FPandBP [2018-06-22 00:39:31,148 INFO ]: Backedges is TWOTRACK [2018-06-22 00:39:31,148 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 00:39:31,148 INFO ]: Difference is false [2018-06-22 00:39:31,148 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 00:39:31,148 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 00:39:31,180 INFO ]: Start isEmpty. Operand 147 states. [2018-06-22 00:39:31,199 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 00:39:31,200 INFO ]: Found error trace [2018-06-22 00:39:31,201 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:39:31,201 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:39:31,208 INFO ]: Analyzing trace with hash 691936512, now seen corresponding path program 1 times [2018-06-22 00:39:31,210 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:39:31,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:39:31,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:39:31,244 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:39:31,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:39:31,298 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:39:31,629 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:39:31,631 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:39:31,631 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 00:39:31,632 INFO ]: Interpolant automaton has 4 states [2018-06-22 00:39:31,643 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 00:39:31,644 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 00:39:31,646 INFO ]: Start difference. First operand 147 states. Second operand 4 states. [2018-06-22 00:39:34,476 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:39:34,476 INFO ]: Finished difference Result 287 states and 559 transitions. [2018-06-22 00:39:34,476 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 00:39:34,477 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 00:39:34,478 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:39:34,525 INFO ]: With dead ends: 287 [2018-06-22 00:39:34,526 INFO ]: Without dead ends: 285 [2018-06-22 00:39:34,527 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:39:34,550 INFO ]: Start minimizeSevpa. Operand 285 states. [2018-06-22 00:39:34,655 INFO ]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-06-22 00:39:34,657 INFO ]: Start removeUnreachable. Operand 285 states. [2018-06-22 00:39:34,685 INFO ]: Finished removeUnreachable. Reduced from 285 states to 285 states and 557 transitions. [2018-06-22 00:39:34,687 INFO ]: Start accepts. Automaton has 285 states and 557 transitions. Word has length 8 [2018-06-22 00:39:34,688 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:39:34,688 INFO ]: Abstraction has 285 states and 557 transitions. [2018-06-22 00:39:34,688 INFO ]: Interpolant automaton has 4 states. [2018-06-22 00:39:34,688 INFO ]: Start isEmpty. Operand 285 states and 557 transitions. [2018-06-22 00:39:34,695 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 00:39:34,695 INFO ]: Found error trace [2018-06-22 00:39:34,695 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:39:34,695 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:39:34,695 INFO ]: Analyzing trace with hash -53384222, now seen corresponding path program 1 times [2018-06-22 00:39:34,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:39:34,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:39:34,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:39:34,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:39:34,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:39:34,703 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:39:34,922 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:39:34,922 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:39:34,922 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 00:39:34,924 INFO ]: Interpolant automaton has 4 states [2018-06-22 00:39:34,924 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 00:39:34,924 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 00:39:34,924 INFO ]: Start difference. First operand 285 states and 557 transitions. Second operand 4 states. [2018-06-22 00:39:36,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:39:36,778 INFO ]: Finished difference Result 426 states and 834 transitions. [2018-06-22 00:39:36,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 00:39:36,779 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 00:39:36,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:39:36,804 INFO ]: With dead ends: 426 [2018-06-22 00:39:36,804 INFO ]: Without dead ends: 426 [2018-06-22 00:39:36,805 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 00:39:36,806 INFO ]: Start minimizeSevpa. Operand 426 states. [2018-06-22 00:39:36,873 INFO ]: Finished minimizeSevpa. Reduced states from 426 to 426. [2018-06-22 00:39:36,873 INFO ]: Start removeUnreachable. Operand 426 states. [2018-06-22 00:39:36,890 INFO ]: Finished removeUnreachable. Reduced from 426 states to 426 states and 834 transitions. [2018-06-22 00:39:36,890 INFO ]: Start accepts. Automaton has 426 states and 834 transitions. Word has length 9 [2018-06-22 00:39:36,890 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:39:36,890 INFO ]: Abstraction has 426 states and 834 transitions. [2018-06-22 00:39:36,890 INFO ]: Interpolant automaton has 4 states. [2018-06-22 00:39:36,890 INFO ]: Start isEmpty. Operand 426 states and 834 transitions. [2018-06-22 00:39:36,894 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 00:39:36,894 INFO ]: Found error trace [2018-06-22 00:39:36,894 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:39:36,894 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:39:36,894 INFO ]: Analyzing trace with hash -1139536627, now seen corresponding path program 1 times [2018-06-22 00:39:36,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:39:36,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:39:36,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:39:36,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:39:36,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:39:36,919 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:39:37,008 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:39:37,008 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:39:37,008 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 00:39:37,009 INFO ]: Interpolant automaton has 4 states [2018-06-22 00:39:37,009 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 00:39:37,009 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 00:39:37,009 INFO ]: Start difference. First operand 426 states and 834 transitions. Second operand 4 states. [2018-06-22 00:39:38,242 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:39:38,242 INFO ]: Finished difference Result 566 states and 1110 transitions. [2018-06-22 00:39:38,243 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 00:39:38,243 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 00:39:38,243 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:39:38,288 INFO ]: With dead ends: 566 [2018-06-22 00:39:38,288 INFO ]: Without dead ends: 566 [2018-06-22 00:39:38,288 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:39:38,290 INFO ]: Start minimizeSevpa. Operand 566 states. [2018-06-22 00:39:38,386 INFO ]: Finished minimizeSevpa. Reduced states from 566 to 566. [2018-06-22 00:39:38,386 INFO ]: Start removeUnreachable. Operand 566 states. [2018-06-22 00:39:38,404 INFO ]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1110 transitions. [2018-06-22 00:39:38,404 INFO ]: Start accepts. Automaton has 566 states and 1110 transitions. Word has length 10 [2018-06-22 00:39:38,404 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:39:38,404 INFO ]: Abstraction has 566 states and 1110 transitions. [2018-06-22 00:39:38,404 INFO ]: Interpolant automaton has 4 states. [2018-06-22 00:39:38,404 INFO ]: Start isEmpty. Operand 566 states and 1110 transitions. [2018-06-22 00:39:38,407 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 00:39:38,407 INFO ]: Found error trace [2018-06-22 00:39:38,407 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:39:38,407 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:39:38,408 INFO ]: Analyzing trace with hash -1195871408, now seen corresponding path program 1 times [2018-06-22 00:39:38,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:39:38,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:39:38,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:39:38,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:39:38,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:39:38,435 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:39:38,633 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:39:38,633 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:39:38,633 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 00:39:38,633 INFO ]: Interpolant automaton has 4 states [2018-06-22 00:39:38,633 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 00:39:38,633 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 00:39:38,634 INFO ]: Start difference. First operand 566 states and 1110 transitions. Second operand 4 states. [2018-06-22 00:39:40,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:39:40,636 INFO ]: Finished difference Result 706 states and 1386 transitions. [2018-06-22 00:39:40,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 00:39:40,636 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 00:39:40,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:39:40,669 INFO ]: With dead ends: 706 [2018-06-22 00:39:40,669 INFO ]: Without dead ends: 706 [2018-06-22 00:39:40,669 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:39:40,671 INFO ]: Start minimizeSevpa. Operand 706 states. [2018-06-22 00:39:40,761 INFO ]: Finished minimizeSevpa. Reduced states from 706 to 706. [2018-06-22 00:39:40,761 INFO ]: Start removeUnreachable. Operand 706 states. [2018-06-22 00:39:40,780 INFO ]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1386 transitions. [2018-06-22 00:39:40,781 INFO ]: Start accepts. Automaton has 706 states and 1386 transitions. Word has length 10 [2018-06-22 00:39:40,781 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:39:40,781 INFO ]: Abstraction has 706 states and 1386 transitions. [2018-06-22 00:39:40,781 INFO ]: Interpolant automaton has 4 states. [2018-06-22 00:39:40,781 INFO ]: Start isEmpty. Operand 706 states and 1386 transitions. [2018-06-22 00:39:40,819 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 00:39:40,819 INFO ]: Found error trace [2018-06-22 00:39:40,819 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:39:40,819 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:39:40,819 INFO ]: Analyzing trace with hash 1196365121, now seen corresponding path program 1 times [2018-06-22 00:39:40,819 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:39:40,819 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:39:40,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:39:40,820 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:39:40,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:39:40,853 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:39:41,009 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:39:41,010 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:39:41,010 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 00:39:41,010 INFO ]: Interpolant automaton has 8 states [2018-06-22 00:39:41,010 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 00:39:41,010 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 00:39:41,010 INFO ]: Start difference. First operand 706 states and 1386 transitions. Second operand 8 states. [2018-06-22 00:39:52,854 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:39:52,854 INFO ]: Finished difference Result 2163 states and 12871 transitions. [2018-06-22 00:39:52,854 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 00:39:52,854 INFO ]: Start accepts. Automaton has 8 states. Word has length 20 [2018-06-22 00:39:52,855 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:39:53,466 INFO ]: With dead ends: 2163 [2018-06-22 00:39:53,466 INFO ]: Without dead ends: 2152 [2018-06-22 00:39:53,467 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-06-22 00:39:53,468 INFO ]: Start minimizeSevpa. Operand 2152 states. [2018-06-22 00:39:54,720 INFO ]: Finished minimizeSevpa. Reduced states from 2152 to 1242. [2018-06-22 00:39:54,720 INFO ]: Start removeUnreachable. Operand 1242 states. [2018-06-22 00:39:54,786 INFO ]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 3215 transitions. [2018-06-22 00:39:54,787 INFO ]: Start accepts. Automaton has 1242 states and 3215 transitions. Word has length 20 [2018-06-22 00:39:54,787 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:39:54,787 INFO ]: Abstraction has 1242 states and 3215 transitions. [2018-06-22 00:39:54,787 INFO ]: Interpolant automaton has 8 states. [2018-06-22 00:39:54,787 INFO ]: Start isEmpty. Operand 1242 states and 3215 transitions. [2018-06-22 00:39:54,827 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 00:39:54,827 INFO ]: Found error trace [2018-06-22 00:39:54,828 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:39:54,828 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:39:54,829 INFO ]: Analyzing trace with hash 945540903, now seen corresponding path program 1 times [2018-06-22 00:39:54,829 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:39:54,829 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:39:54,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:39:54,830 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:39:54,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:39:54,876 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:39:55,206 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:39:55,206 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:39:55,206 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 00:39:55,206 INFO ]: Interpolant automaton has 8 states [2018-06-22 00:39:55,206 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 00:39:55,206 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 00:39:55,206 INFO ]: Start difference. First operand 1242 states and 3215 transitions. Second operand 8 states. [2018-06-22 00:40:08,119 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:40:08,119 INFO ]: Finished difference Result 4280 states and 43737 transitions. [2018-06-22 00:40:08,122 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 00:40:08,122 INFO ]: Start accepts. Automaton has 8 states. Word has length 20 [2018-06-22 00:40:08,122 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:40:11,684 INFO ]: With dead ends: 4280 [2018-06-22 00:40:11,684 INFO ]: Without dead ends: 4017 [2018-06-22 00:40:11,685 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2018-06-22 00:40:11,687 INFO ]: Start minimizeSevpa. Operand 4017 states. [2018-06-22 00:40:15,358 INFO ]: Finished minimizeSevpa. Reduced states from 4017 to 2103. [2018-06-22 00:40:15,358 INFO ]: Start removeUnreachable. Operand 2103 states. [2018-06-22 00:40:15,506 INFO ]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 7630 transitions. [2018-06-22 00:40:15,506 INFO ]: Start accepts. Automaton has 2103 states and 7630 transitions. Word has length 20 [2018-06-22 00:40:15,507 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:40:15,507 INFO ]: Abstraction has 2103 states and 7630 transitions. [2018-06-22 00:40:15,507 INFO ]: Interpolant automaton has 8 states. [2018-06-22 00:40:15,507 INFO ]: Start isEmpty. Operand 2103 states and 7630 transitions. [2018-06-22 00:40:15,580 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 00:40:15,580 INFO ]: Found error trace [2018-06-22 00:40:15,580 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:40:15,580 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:40:15,581 INFO ]: Analyzing trace with hash 1245433619, now seen corresponding path program 1 times [2018-06-22 00:40:15,581 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:40:15,581 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:40:15,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:40:15,582 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:40:15,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:40:15,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:40:16,324 INFO ]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 00:40:16,324 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:40:16,324 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 00:40:16,324 INFO ]: Interpolant automaton has 8 states [2018-06-22 00:40:16,324 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 00:40:16,324 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 00:40:16,325 INFO ]: Start difference. First operand 2103 states and 7630 transitions. Second operand 8 states. Received shutdown request... [2018-06-22 00:40:24,769 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 00:40:24,769 WARN ]: Verification canceled [2018-06-22 00:40:24,775 WARN ]: Timeout [2018-06-22 00:40:24,775 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:40:24 BoogieIcfgContainer [2018-06-22 00:40:24,776 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 00:40:24,776 INFO ]: Toolchain (without parser) took 56423.61 ms. Allocated memory was 309.3 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 229.9 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 262.2 MB. Max. memory is 3.6 GB. [2018-06-22 00:40:24,780 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 00:40:24,780 INFO ]: ChcToBoogie took 155.30 ms. Allocated memory is still 309.3 MB. Free memory was 229.9 MB in the beginning and 223.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:40:24,781 INFO ]: Boogie Preprocessor took 83.41 ms. Allocated memory is still 309.3 MB. Free memory was 223.9 MB in the beginning and 221.9 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:40:24,781 INFO ]: RCFGBuilder took 2465.88 ms. Allocated memory was 309.3 MB in the beginning and 324.5 MB in the end (delta: 15.2 MB). Free memory was 221.9 MB in the beginning and 221.0 MB in the end (delta: 918.8 kB). Peak memory consumption was 39.3 MB. Max. memory is 3.6 GB. [2018-06-22 00:40:24,782 INFO ]: TraceAbstraction took 53710.42 ms. Allocated memory was 324.5 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 221.0 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 238.1 MB. Max. memory is 3.6 GB. [2018-06-22 00:40:24,788 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 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 155.30 ms. Allocated memory is still 309.3 MB. Free memory was 229.9 MB in the beginning and 223.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 83.41 ms. Allocated memory is still 309.3 MB. Free memory was 223.9 MB in the beginning and 221.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 2465.88 ms. Allocated memory was 309.3 MB in the beginning and 324.5 MB in the end (delta: 15.2 MB). Free memory was 221.9 MB in the beginning and 221.0 MB in the end (delta: 918.8 kB). Peak memory consumption was 39.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 53710.42 ms. Allocated memory was 324.5 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 221.0 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 238.1 MB. 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 (2103states) and interpolant automaton (currently 19 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (6035 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 147 locations, 1 error locations. TIMEOUT Result, 53.6s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 45.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4801 SDtfs, 1771 SDslu, 12050 SDs, 0 SdLazy, 26400 SolverSat, 6155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2103occurred 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: 5.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 2824 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 2627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 13/13 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/fortune-full-nonrobust.22.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_00-40-24-808.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.22.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_00-40-24-808.csv Completed graceful shutdown