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/HOLA/02.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 00:55:00,698 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 00:55:00,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 00:55:00,709 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 00:55:00,710 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 00:55:00,710 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 00:55:00,711 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 00:55:00,716 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 00:55:00,717 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 00:55:00,718 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 00:55:00,719 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 00:55:00,720 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 00:55:00,720 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 00:55:00,721 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 00:55:00,725 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 00:55:00,726 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 00:55:00,727 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 00:55:00,740 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 00:55:00,741 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 00:55:00,742 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 00:55:00,743 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 00:55:00,745 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 00:55:00,745 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 00:55:00,745 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 00:55:00,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 00:55:00,749 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 00:55:00,749 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 00:55:00,750 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 00:55:00,751 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 00:55:00,751 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 00:55:00,752 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 00:55:00,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 00:55:00,755 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 00:55:00,756 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 00:55:00,756 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 00:55:00,757 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:55:00,775 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 00:55:00,777 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 00:55:00,777 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 00:55:00,777 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 00:55:00,778 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 00:55:00,778 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 00:55:00,778 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 00:55:00,779 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 00:55:00,779 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:55:00,779 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 00:55:00,779 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 00:55:00,779 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 00:55:00,779 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 00:55:00,780 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 00:55:00,780 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 00:55:00,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 00:55:00,781 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 00:55:00,782 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 00:55:00,782 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 00:55:00,826 INFO ]: Repository-Root is: /tmp [2018-06-22 00:55:00,843 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 00:55:00,848 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 00:55:00,849 INFO ]: Initializing SmtParser... [2018-06-22 00:55:00,849 INFO ]: SmtParser initialized [2018-06-22 00:55:00,850 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/02.c.smt2 [2018-06-22 00:55:00,851 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:55:00,930 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/02.c.smt2 unknown [2018-06-22 00:55:01,481 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/02.c.smt2 [2018-06-22 00:55:01,486 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 00:55:01,500 INFO ]: Walking toolchain with 4 elements. [2018-06-22 00:55:01,501 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 00:55:01,501 INFO ]: Initializing ChcToBoogie... [2018-06-22 00:55:01,501 INFO ]: ChcToBoogie initialized [2018-06-22 00:55:01,512 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:55:01" (1/1) ... [2018-06-22 00:55:01,583 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:01 Unit [2018-06-22 00:55:01,583 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 00:55:01,584 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 00:55:01,584 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 00:55:01,584 INFO ]: Boogie Preprocessor initialized [2018-06-22 00:55:01,600 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:01" (1/1) ... [2018-06-22 00:55:01,600 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:01" (1/1) ... [2018-06-22 00:55:01,612 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:01" (1/1) ... [2018-06-22 00:55:01,613 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:01" (1/1) ... [2018-06-22 00:55:01,625 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:01" (1/1) ... [2018-06-22 00:55:01,627 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:01" (1/1) ... [2018-06-22 00:55:01,629 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:01" (1/1) ... [2018-06-22 00:55:01,635 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 00:55:01,635 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 00:55:01,635 INFO ]: Initializing RCFGBuilder... [2018-06-22 00:55:01,635 INFO ]: RCFGBuilder initialized [2018-06-22 00:55:01,636 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:01" (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:55:01,646 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 00:55:01,646 INFO ]: Found specification of procedure gotoProc [2018-06-22 00:55:01,646 INFO ]: Found implementation of procedure gotoProc [2018-06-22 00:55:01,646 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 00:55:01,646 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 00:55:01,646 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:55:02,439 INFO ]: Using library mode [2018-06-22 00:55:02,440 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:55:02 BoogieIcfgContainer [2018-06-22 00:55:02,440 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 00:55:02,442 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 00:55:02,442 INFO ]: Initializing TraceAbstraction... [2018-06-22 00:55:02,447 INFO ]: TraceAbstraction initialized [2018-06-22 00:55:02,448 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:55:01" (1/3) ... [2018-06-22 00:55:02,448 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277cf62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:55:02, skipping insertion in model container [2018-06-22 00:55:02,448 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:01" (2/3) ... [2018-06-22 00:55:02,449 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277cf62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:55:02, skipping insertion in model container [2018-06-22 00:55:02,449 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:55:02" (3/3) ... [2018-06-22 00:55:02,451 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 00:55:02,462 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 00:55:02,470 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 00:55:02,527 INFO ]: Using default assertion order modulation [2018-06-22 00:55:02,528 INFO ]: Interprodecural is true [2018-06-22 00:55:02,528 INFO ]: Hoare is false [2018-06-22 00:55:02,528 INFO ]: Compute interpolants for FPandBP [2018-06-22 00:55:02,528 INFO ]: Backedges is TWOTRACK [2018-06-22 00:55:02,528 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 00:55:02,528 INFO ]: Difference is false [2018-06-22 00:55:02,528 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 00:55:02,528 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 00:55:02,549 INFO ]: Start isEmpty. Operand 32 states. [2018-06-22 00:55:02,564 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 00:55:02,564 INFO ]: Found error trace [2018-06-22 00:55:02,565 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:55:02,565 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:02,571 INFO ]: Analyzing trace with hash -1922246344, now seen corresponding path program 1 times [2018-06-22 00:55:02,573 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:02,574 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:02,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:02,616 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:02,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:02,750 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:03,407 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:55:03,409 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:03,409 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 00:55:03,411 INFO ]: Interpolant automaton has 13 states [2018-06-22 00:55:03,422 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 00:55:03,422 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 00:55:03,424 INFO ]: Start difference. First operand 32 states. Second operand 13 states. [2018-06-22 00:55:03,895 WARN ]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-22 00:55:04,248 WARN ]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-22 00:55:04,823 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:04,823 INFO ]: Finished difference Result 49 states and 56 transitions. [2018-06-22 00:55:04,824 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 00:55:04,824 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 00:55:04,825 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:04,831 INFO ]: With dead ends: 49 [2018-06-22 00:55:04,831 INFO ]: Without dead ends: 46 [2018-06-22 00:55:04,834 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2018-06-22 00:55:04,854 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 00:55:04,871 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-06-22 00:55:04,873 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 00:55:04,874 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-06-22 00:55:04,875 INFO ]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2018-06-22 00:55:04,875 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:04,875 INFO ]: Abstraction has 34 states and 38 transitions. [2018-06-22 00:55:04,875 INFO ]: Interpolant automaton has 13 states. [2018-06-22 00:55:04,875 INFO ]: Start isEmpty. Operand 34 states and 38 transitions. [2018-06-22 00:55:04,876 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 00:55:04,876 INFO ]: Found error trace [2018-06-22 00:55:04,876 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:55:04,876 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:04,876 INFO ]: Analyzing trace with hash -1080910245, now seen corresponding path program 1 times [2018-06-22 00:55:04,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:04,876 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:04,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:04,877 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:04,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:04,920 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:05,115 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:05,116 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:05,116 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:05,117 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:05,117 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:05,117 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:05,118 INFO ]: Start difference. First operand 34 states and 38 transitions. Second operand 11 states. [2018-06-22 00:55:05,715 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:05,715 INFO ]: Finished difference Result 92 states and 107 transitions. [2018-06-22 00:55:05,716 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 00:55:05,716 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 00:55:05,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:05,720 INFO ]: With dead ends: 92 [2018-06-22 00:55:05,720 INFO ]: Without dead ends: 91 [2018-06-22 00:55:05,721 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2018-06-22 00:55:05,722 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 00:55:05,727 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 38. [2018-06-22 00:55:05,727 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 00:55:05,728 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-06-22 00:55:05,728 INFO ]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 28 [2018-06-22 00:55:05,729 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:05,729 INFO ]: Abstraction has 38 states and 44 transitions. [2018-06-22 00:55:05,729 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:05,729 INFO ]: Start isEmpty. Operand 38 states and 44 transitions. [2018-06-22 00:55:05,729 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 00:55:05,729 INFO ]: Found error trace [2018-06-22 00:55:05,730 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:55:05,730 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:05,730 INFO ]: Analyzing trace with hash -1409550821, now seen corresponding path program 1 times [2018-06-22 00:55:05,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:05,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:05,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:05,731 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:05,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:05,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:05,998 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:05,998 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:05,998 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:05,998 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:05,998 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:05,998 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:05,998 INFO ]: Start difference. First operand 38 states and 44 transitions. Second operand 11 states. [2018-06-22 00:55:06,331 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:06,331 INFO ]: Finished difference Result 56 states and 63 transitions. [2018-06-22 00:55:06,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 00:55:06,333 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 00:55:06,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:06,334 INFO ]: With dead ends: 56 [2018-06-22 00:55:06,334 INFO ]: Without dead ends: 52 [2018-06-22 00:55:06,335 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-06-22 00:55:06,335 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 00:55:06,338 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 35. [2018-06-22 00:55:06,338 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 00:55:06,339 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-06-22 00:55:06,339 INFO ]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 28 [2018-06-22 00:55:06,339 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:06,339 INFO ]: Abstraction has 35 states and 40 transitions. [2018-06-22 00:55:06,339 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:06,339 INFO ]: Start isEmpty. Operand 35 states and 40 transitions. [2018-06-22 00:55:06,340 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 00:55:06,340 INFO ]: Found error trace [2018-06-22 00:55:06,340 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:55:06,340 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:06,341 INFO ]: Analyzing trace with hash 913125019, now seen corresponding path program 1 times [2018-06-22 00:55:06,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:06,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:06,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:06,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:06,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:06,372 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:06,489 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:06,489 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:06,489 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:06,490 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:06,490 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:06,490 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:06,490 INFO ]: Start difference. First operand 35 states and 40 transitions. Second operand 11 states. [2018-06-22 00:55:06,861 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:06,861 INFO ]: Finished difference Result 91 states and 105 transitions. [2018-06-22 00:55:06,862 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 00:55:06,862 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 00:55:06,863 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:06,864 INFO ]: With dead ends: 91 [2018-06-22 00:55:06,864 INFO ]: Without dead ends: 90 [2018-06-22 00:55:06,864 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2018-06-22 00:55:06,865 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 00:55:06,869 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 38. [2018-06-22 00:55:06,869 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 00:55:06,870 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-06-22 00:55:06,870 INFO ]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 28 [2018-06-22 00:55:06,870 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:06,870 INFO ]: Abstraction has 38 states and 43 transitions. [2018-06-22 00:55:06,870 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:06,870 INFO ]: Start isEmpty. Operand 38 states and 43 transitions. [2018-06-22 00:55:06,871 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 00:55:06,871 INFO ]: Found error trace [2018-06-22 00:55:06,871 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:55:06,871 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:06,871 INFO ]: Analyzing trace with hash 584484443, now seen corresponding path program 1 times [2018-06-22 00:55:06,871 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:06,872 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:06,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:06,872 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:06,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:06,894 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:07,146 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:07,147 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:07,147 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:07,147 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:07,147 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:07,147 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:07,147 INFO ]: Start difference. First operand 38 states and 43 transitions. Second operand 11 states. [2018-06-22 00:55:07,372 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:07,372 INFO ]: Finished difference Result 55 states and 61 transitions. [2018-06-22 00:55:07,373 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 00:55:07,373 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 00:55:07,373 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:07,374 INFO ]: With dead ends: 55 [2018-06-22 00:55:07,374 INFO ]: Without dead ends: 51 [2018-06-22 00:55:07,375 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-06-22 00:55:07,375 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 00:55:07,377 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-06-22 00:55:07,378 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 00:55:07,378 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-06-22 00:55:07,378 INFO ]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2018-06-22 00:55:07,379 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:07,379 INFO ]: Abstraction has 35 states and 39 transitions. [2018-06-22 00:55:07,379 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:07,379 INFO ]: Start isEmpty. Operand 35 states and 39 transitions. [2018-06-22 00:55:07,379 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 00:55:07,379 INFO ]: Found error trace [2018-06-22 00:55:07,379 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:55:07,379 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:07,380 INFO ]: Analyzing trace with hash -1394533822, now seen corresponding path program 1 times [2018-06-22 00:55:07,380 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:07,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:07,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:07,381 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:07,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:07,404 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:07,621 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:07,621 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:07,621 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:55:07,622 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:55:07,622 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:55:07,622 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:55:07,622 INFO ]: Start difference. First operand 35 states and 39 transitions. Second operand 12 states. [2018-06-22 00:55:07,954 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:07,954 INFO ]: Finished difference Result 76 states and 87 transitions. [2018-06-22 00:55:07,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 00:55:07,955 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 00:55:07,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:07,956 INFO ]: With dead ends: 76 [2018-06-22 00:55:07,956 INFO ]: Without dead ends: 75 [2018-06-22 00:55:07,957 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2018-06-22 00:55:07,957 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 00:55:07,960 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 39. [2018-06-22 00:55:07,960 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 00:55:07,961 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-06-22 00:55:07,961 INFO ]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2018-06-22 00:55:07,961 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:07,961 INFO ]: Abstraction has 39 states and 43 transitions. [2018-06-22 00:55:07,961 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:55:07,961 INFO ]: Start isEmpty. Operand 39 states and 43 transitions. [2018-06-22 00:55:07,962 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 00:55:07,962 INFO ]: Found error trace [2018-06-22 00:55:07,962 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:55:07,962 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:07,962 INFO ]: Analyzing trace with hash -1723174398, now seen corresponding path program 1 times [2018-06-22 00:55:07,962 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:07,962 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:07,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:07,963 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:07,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:07,985 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:08,208 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:08,208 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:08,208 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:55:08,208 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:55:08,208 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:55:08,209 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:55:08,209 INFO ]: Start difference. First operand 39 states and 43 transitions. Second operand 12 states. [2018-06-22 00:55:08,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:08,333 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-22 00:55:08,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 00:55:08,333 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 00:55:08,334 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:08,334 INFO ]: With dead ends: 19 [2018-06-22 00:55:08,334 INFO ]: Without dead ends: 0 [2018-06-22 00:55:08,334 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-06-22 00:55:08,334 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 00:55:08,334 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 00:55:08,334 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 00:55:08,334 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 00:55:08,334 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-06-22 00:55:08,334 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:08,334 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 00:55:08,334 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:55:08,334 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 00:55:08,334 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 00:55:08,340 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:55:08 BoogieIcfgContainer [2018-06-22 00:55:08,340 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 00:55:08,341 INFO ]: Toolchain (without parser) took 6854.67 ms. Allocated memory was 308.3 MB in the beginning and 388.5 MB in the end (delta: 80.2 MB). Free memory was 243.4 MB in the beginning and 304.6 MB in the end (delta: -61.2 MB). Peak memory consumption was 19.1 MB. Max. memory is 3.6 GB. [2018-06-22 00:55:08,342 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 00:55:08,342 INFO ]: ChcToBoogie took 82.37 ms. Allocated memory is still 308.3 MB. Free memory was 243.4 MB in the beginning and 239.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:55:08,343 INFO ]: Boogie Preprocessor took 51.10 ms. Allocated memory is still 308.3 MB. Free memory was 239.4 MB in the beginning and 237.4 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:55:08,343 INFO ]: RCFGBuilder took 805.26 ms. Allocated memory is still 308.3 MB. Free memory was 237.4 MB in the beginning and 197.5 MB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:55:08,343 INFO ]: TraceAbstraction took 5898.52 ms. Allocated memory was 308.3 MB in the beginning and 388.5 MB in the end (delta: 80.2 MB). Free memory was 195.5 MB in the beginning and 304.6 MB in the end (delta: -109.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 00:55:08,347 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.3 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 82.37 ms. Allocated memory is still 308.3 MB. Free memory was 243.4 MB in the beginning and 239.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 51.10 ms. Allocated memory is still 308.3 MB. Free memory was 239.4 MB in the beginning and 237.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 805.26 ms. Allocated memory is still 308.3 MB. Free memory was 237.4 MB in the beginning and 197.5 MB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5898.52 ms. Allocated memory was 308.3 MB in the beginning and 388.5 MB in the end (delta: 80.2 MB). Free memory was 195.5 MB in the beginning and 304.6 MB in the end (delta: -109.1 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. SAFE Result, 5.8s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 197 SDtfs, 1032 SDslu, 1791 SDs, 0 SdLazy, 491 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred 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: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 186 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 9456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 24/24 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/02.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_00-55-08-357.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/02.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_00-55-08-357.csv Received shutdown request...