java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/011d-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:26:17,865 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:26:17,873 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:26:17,892 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:26:17,892 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:26:17,893 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:26:17,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:26:17,899 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:26:17,900 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:26:17,902 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:26:17,903 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:26:17,903 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:26:17,904 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:26:17,905 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:26:17,908 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:26:17,909 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:26:17,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:26:17,923 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:26:17,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:26:17,925 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:26:17,926 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:26:17,928 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:26:17,929 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:26:17,929 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:26:17,930 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:26:17,931 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:26:17,931 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:26:17,932 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:26:17,933 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:26:17,933 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:26:17,934 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:26:17,934 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:26:17,934 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:26:17,935 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:26:17,936 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:26:17,936 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:26:17,949 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:26:17,950 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:26:17,950 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:26:17,950 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:26:17,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:26:17,951 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:26:17,951 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:26:17,951 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:26:17,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:26:17,952 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:26:17,952 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:26:17,952 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:26:17,952 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:26:17,953 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:26:17,953 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:26:17,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:26:17,953 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:26:17,954 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:26:17,955 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:26:18,000 INFO ]: Repository-Root is: /tmp [2018-06-22 01:26:18,015 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:26:18,022 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:26:18,024 INFO ]: Initializing SmtParser... [2018-06-22 01:26:18,024 INFO ]: SmtParser initialized [2018-06-22 01:26:18,025 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/011d-horn.smt2 [2018-06-22 01:26:18,026 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:26:18,120 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011d-horn.smt2 unknown [2018-06-22 01:26:18,475 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011d-horn.smt2 [2018-06-22 01:26:18,479 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:26:18,486 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:26:18,486 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:26:18,486 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:26:18,486 INFO ]: ChcToBoogie initialized [2018-06-22 01:26:18,489 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:26:18" (1/1) ... [2018-06-22 01:26:18,557 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:18 Unit [2018-06-22 01:26:18,557 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:26:18,558 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:26:18,558 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:26:18,558 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:26:18,580 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:18" (1/1) ... [2018-06-22 01:26:18,580 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:18" (1/1) ... [2018-06-22 01:26:18,591 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:18" (1/1) ... [2018-06-22 01:26:18,591 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:18" (1/1) ... [2018-06-22 01:26:18,607 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:18" (1/1) ... [2018-06-22 01:26:18,619 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:18" (1/1) ... [2018-06-22 01:26:18,621 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:18" (1/1) ... [2018-06-22 01:26:18,623 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:26:18,623 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:26:18,623 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:26:18,623 INFO ]: RCFGBuilder initialized [2018-06-22 01:26:18,624 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:18" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:26:18,649 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:26:18,649 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:26:18,649 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:26:18,649 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:26:18,649 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:26:18,649 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:26:19,223 INFO ]: Using library mode [2018-06-22 01:26:19,224 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:26:19 BoogieIcfgContainer [2018-06-22 01:26:19,224 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:26:19,228 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:26:19,228 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:26:19,231 INFO ]: TraceAbstraction initialized [2018-06-22 01:26:19,231 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:26:18" (1/3) ... [2018-06-22 01:26:19,234 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf9d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:26:19, skipping insertion in model container [2018-06-22 01:26:19,234 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:26:18" (2/3) ... [2018-06-22 01:26:19,235 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf9d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:26:19, skipping insertion in model container [2018-06-22 01:26:19,235 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:26:19" (3/3) ... [2018-06-22 01:26:19,236 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:26:19,246 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:26:19,256 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:26:19,297 INFO ]: Using default assertion order modulation [2018-06-22 01:26:19,298 INFO ]: Interprodecural is true [2018-06-22 01:26:19,298 INFO ]: Hoare is false [2018-06-22 01:26:19,298 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:26:19,298 INFO ]: Backedges is TWOTRACK [2018-06-22 01:26:19,298 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:26:19,298 INFO ]: Difference is false [2018-06-22 01:26:19,298 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:26:19,298 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:26:19,311 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:26:19,321 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-22 01:26:19,322 INFO ]: Found error trace [2018-06-22 01:26:19,322 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-22 01:26:19,322 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:19,328 INFO ]: Analyzing trace with hash 372961838, now seen corresponding path program 1 times [2018-06-22 01:26:19,330 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:19,330 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:19,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:19,364 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:19,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:19,389 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:19,424 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:19,426 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:19,426 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:26:19,428 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:26:19,442 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:26:19,442 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:26:19,444 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-22 01:26:19,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:19,463 INFO ]: Finished difference Result 10 states and 28 transitions. [2018-06-22 01:26:19,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:26:19,464 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-22 01:26:19,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:19,474 INFO ]: With dead ends: 10 [2018-06-22 01:26:19,474 INFO ]: Without dead ends: 10 [2018-06-22 01:26:19,475 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:26:19,488 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:26:19,503 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:26:19,504 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:26:19,504 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2018-06-22 01:26:19,505 INFO ]: Start accepts. Automaton has 10 states and 28 transitions. Word has length 6 [2018-06-22 01:26:19,506 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:19,506 INFO ]: Abstraction has 10 states and 28 transitions. [2018-06-22 01:26:19,506 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:26:19,506 INFO ]: Start isEmpty. Operand 10 states and 28 transitions. [2018-06-22 01:26:19,506 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:26:19,506 INFO ]: Found error trace [2018-06-22 01:26:19,506 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:19,506 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:19,507 INFO ]: Analyzing trace with hash -1344599525, now seen corresponding path program 1 times [2018-06-22 01:26:19,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:19,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:19,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:19,507 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:19,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:19,521 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:19,566 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:19,566 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:19,566 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:19,567 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:19,568 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:19,568 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:19,568 INFO ]: Start difference. First operand 10 states and 28 transitions. Second operand 3 states. [2018-06-22 01:26:19,751 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:19,751 INFO ]: Finished difference Result 11 states and 28 transitions. [2018-06-22 01:26:19,752 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:19,752 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:26:19,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:19,752 INFO ]: With dead ends: 11 [2018-06-22 01:26:19,752 INFO ]: Without dead ends: 10 [2018-06-22 01:26:19,753 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:19,753 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:26:19,755 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:26:19,755 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:26:19,755 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2018-06-22 01:26:19,756 INFO ]: Start accepts. Automaton has 10 states and 25 transitions. Word has length 7 [2018-06-22 01:26:19,756 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:19,756 INFO ]: Abstraction has 10 states and 25 transitions. [2018-06-22 01:26:19,756 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:19,756 INFO ]: Start isEmpty. Operand 10 states and 25 transitions. [2018-06-22 01:26:19,756 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:26:19,756 INFO ]: Found error trace [2018-06-22 01:26:19,756 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:19,756 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:19,756 INFO ]: Analyzing trace with hash -1358452340, now seen corresponding path program 1 times [2018-06-22 01:26:19,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:19,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:19,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:19,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:19,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:19,765 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:19,827 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:19,827 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:19,827 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:19,827 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:19,827 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:19,827 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:19,827 INFO ]: Start difference. First operand 10 states and 25 transitions. Second operand 3 states. [2018-06-22 01:26:19,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:19,952 INFO ]: Finished difference Result 11 states and 25 transitions. [2018-06-22 01:26:19,952 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:19,952 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:26:19,952 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:19,953 INFO ]: With dead ends: 11 [2018-06-22 01:26:19,953 INFO ]: Without dead ends: 10 [2018-06-22 01:26:19,953 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:19,953 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:26:19,955 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:26:19,955 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:26:19,955 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2018-06-22 01:26:19,955 INFO ]: Start accepts. Automaton has 10 states and 23 transitions. Word has length 7 [2018-06-22 01:26:19,955 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:19,955 INFO ]: Abstraction has 10 states and 23 transitions. [2018-06-22 01:26:19,955 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:19,956 INFO ]: Start isEmpty. Operand 10 states and 23 transitions. [2018-06-22 01:26:19,956 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:26:19,956 INFO ]: Found error trace [2018-06-22 01:26:19,956 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:19,956 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:19,956 INFO ]: Analyzing trace with hash -1322435021, now seen corresponding path program 1 times [2018-06-22 01:26:19,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:19,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:19,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:19,957 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:19,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:19,965 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:20,011 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:20,011 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:20,011 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:20,011 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:20,011 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:20,011 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:20,011 INFO ]: Start difference. First operand 10 states and 23 transitions. Second operand 3 states. [2018-06-22 01:26:20,040 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:20,040 INFO ]: Finished difference Result 13 states and 26 transitions. [2018-06-22 01:26:20,041 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:20,041 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:26:20,041 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:20,042 INFO ]: With dead ends: 13 [2018-06-22 01:26:20,042 INFO ]: Without dead ends: 13 [2018-06-22 01:26:20,043 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:20,043 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:26:20,045 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-22 01:26:20,045 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:26:20,046 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2018-06-22 01:26:20,046 INFO ]: Start accepts. Automaton has 10 states and 20 transitions. Word has length 7 [2018-06-22 01:26:20,046 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:20,046 INFO ]: Abstraction has 10 states and 20 transitions. [2018-06-22 01:26:20,046 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:20,046 INFO ]: Start isEmpty. Operand 10 states and 20 transitions. [2018-06-22 01:26:20,046 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:26:20,046 INFO ]: Found error trace [2018-06-22 01:26:20,046 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:20,046 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:20,047 INFO ]: Analyzing trace with hash -1322196693, now seen corresponding path program 1 times [2018-06-22 01:26:20,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:20,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:20,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:20,047 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:20,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:20,055 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:20,084 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:20,084 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:20,084 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:20,085 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:20,085 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:20,085 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:20,085 INFO ]: Start difference. First operand 10 states and 20 transitions. Second operand 3 states. [2018-06-22 01:26:20,105 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:20,105 INFO ]: Finished difference Result 14 states and 29 transitions. [2018-06-22 01:26:20,105 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:20,106 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:26:20,106 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:20,106 INFO ]: With dead ends: 14 [2018-06-22 01:26:20,106 INFO ]: Without dead ends: 14 [2018-06-22 01:26:20,106 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:20,106 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:26:20,109 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-22 01:26:20,109 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:26:20,109 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-06-22 01:26:20,109 INFO ]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 7 [2018-06-22 01:26:20,109 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:20,109 INFO ]: Abstraction has 11 states and 23 transitions. [2018-06-22 01:26:20,109 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:20,109 INFO ]: Start isEmpty. Operand 11 states and 23 transitions. [2018-06-22 01:26:20,109 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:26:20,109 INFO ]: Found error trace [2018-06-22 01:26:20,109 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:20,110 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:20,110 INFO ]: Analyzing trace with hash -1335960135, now seen corresponding path program 1 times [2018-06-22 01:26:20,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:20,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:20,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:20,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:20,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:20,118 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:26:20,133 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:26:20,133 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:26:20,134 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:26:20,134 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:26:20,134 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:26:20,134 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:20,134 INFO ]: Start difference. First operand 11 states and 23 transitions. Second operand 3 states. [2018-06-22 01:26:20,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:26:20,147 INFO ]: Finished difference Result 13 states and 24 transitions. [2018-06-22 01:26:20,148 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:26:20,148 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:26:20,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:26:20,148 INFO ]: With dead ends: 13 [2018-06-22 01:26:20,148 INFO ]: Without dead ends: 13 [2018-06-22 01:26:20,149 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:26:20,149 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:26:20,150 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-22 01:26:20,150 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:26:20,151 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2018-06-22 01:26:20,151 INFO ]: Start accepts. Automaton has 11 states and 22 transitions. Word has length 7 [2018-06-22 01:26:20,151 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:26:20,151 INFO ]: Abstraction has 11 states and 22 transitions. [2018-06-22 01:26:20,151 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:26:20,151 INFO ]: Start isEmpty. Operand 11 states and 22 transitions. [2018-06-22 01:26:20,151 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:26:20,151 INFO ]: Found error trace [2018-06-22 01:26:20,151 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:26:20,151 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:26:20,152 INFO ]: Analyzing trace with hash -1335930344, now seen corresponding path program 1 times [2018-06-22 01:26:20,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:26:20,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:26:20,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:20,152 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:26:20,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:26:20,163 INFO ]: Conjunction of SSA is sat [2018-06-22 01:26:20,164 INFO ]: Counterexample might be feasible [2018-06-22 01:26:20,177 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:26:20 BoogieIcfgContainer [2018-06-22 01:26:20,177 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:26:20,177 INFO ]: Toolchain (without parser) took 1697.53 ms. Allocated memory is still 305.7 MB. Free memory was 256.1 MB in the beginning and 196.2 MB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:26:20,179 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:26:20,179 INFO ]: ChcToBoogie took 71.47 ms. Allocated memory is still 305.7 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:26:20,180 INFO ]: Boogie Preprocessor took 65.06 ms. Allocated memory is still 305.7 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:26:20,180 INFO ]: RCFGBuilder took 600.42 ms. Allocated memory is still 305.7 MB. Free memory was 252.1 MB in the beginning and 234.1 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:26:20,181 INFO ]: TraceAbstraction took 948.47 ms. Allocated memory is still 305.7 MB. Free memory was 234.1 MB in the beginning and 196.2 MB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:26:20,184 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 305.7 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 71.47 ms. Allocated memory is still 305.7 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 65.06 ms. Allocated memory is still 305.7 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 600.42 ms. Allocated memory is still 305.7 MB. Free memory was 252.1 MB in the beginning and 234.1 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 948.47 ms. Allocated memory is still 305.7 MB. Free memory was 234.1 MB in the beginning and 196.2 MB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] assume (((((!(hbv_False_1_Int + 1 == 0) && 2 - hbv_False_4_Int + -1 >= 0) && hbv_False_2_Int + -1 >= 0) && hbv_False_2_Int == hbv_False_4_Int) && !(hbv_False_1_Int + 1 <= -1)) && hbv_False_2_Int + -1 == hbv_False_3_Int) && !(hbv_False_4_Int + -1 + -1 >= 0); [L0] hhv_REC_f__0_Int, hhv_REC_f__1_Int := hbv_False_3_Int, hbv_False_1_Int; [L0] havoc hbv_False_3_Int, hbv_False_1_Int, hbv_False_4_Int, hbv_False_2_Int; [L0] assume (!(hhv_REC_f__0_Int <= -1) && hhv_REC_f__1_Int == hhv_REC_f__0_Int) && !(hhv_REC_f__0_Int + -1 >= 0); [L0] RET call gotoProc(0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 138 SDtfs, 22 SDslu, 63 SDs, 0 SdLazy, 38 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-26-20-202.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-26-20-202.csv Received shutdown request...