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/05.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 00:55:17,377 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 00:55:17,379 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 00:55:17,393 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 00:55:17,393 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 00:55:17,394 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 00:55:17,395 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 00:55:17,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 00:55:17,399 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 00:55:17,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 00:55:17,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 00:55:17,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 00:55:17,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 00:55:17,407 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 00:55:17,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 00:55:17,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 00:55:17,410 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 00:55:17,423 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 00:55:17,425 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 00:55:17,426 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 00:55:17,427 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 00:55:17,429 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 00:55:17,429 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 00:55:17,429 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 00:55:17,430 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 00:55:17,435 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 00:55:17,436 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 00:55:17,437 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 00:55:17,438 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 00:55:17,438 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 00:55:17,439 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 00:55:17,439 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 00:55:17,439 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 00:55:17,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 00:55:17,445 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 00:55:17,445 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:17,460 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 00:55:17,460 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 00:55:17,460 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 00:55:17,461 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 00:55:17,462 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 00:55:17,462 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 00:55:17,462 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 00:55:17,462 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 00:55:17,463 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:55:17,463 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 00:55:17,463 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 00:55:17,464 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 00:55:17,464 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 00:55:17,464 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 00:55:17,464 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 00:55:17,464 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 00:55:17,465 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 00:55:17,466 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 00:55:17,466 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 00:55:17,507 INFO ]: Repository-Root is: /tmp [2018-06-22 00:55:17,518 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 00:55:17,523 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 00:55:17,525 INFO ]: Initializing SmtParser... [2018-06-22 00:55:17,525 INFO ]: SmtParser initialized [2018-06-22 00:55:17,526 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/05.c.smt2 [2018-06-22 00:55:17,527 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:17,619 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/05.c.smt2 unknown [2018-06-22 00:55:18,092 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/05.c.smt2 [2018-06-22 00:55:18,096 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 00:55:18,102 INFO ]: Walking toolchain with 4 elements. [2018-06-22 00:55:18,103 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 00:55:18,103 INFO ]: Initializing ChcToBoogie... [2018-06-22 00:55:18,103 INFO ]: ChcToBoogie initialized [2018-06-22 00:55:18,106 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:55:18" (1/1) ... [2018-06-22 00:55:18,210 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:18 Unit [2018-06-22 00:55:18,210 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 00:55:18,211 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 00:55:18,211 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 00:55:18,211 INFO ]: Boogie Preprocessor initialized [2018-06-22 00:55:18,224 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:18" (1/1) ... [2018-06-22 00:55:18,224 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:18" (1/1) ... [2018-06-22 00:55:18,231 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:18" (1/1) ... [2018-06-22 00:55:18,231 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:18" (1/1) ... [2018-06-22 00:55:18,236 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:18" (1/1) ... [2018-06-22 00:55:18,237 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:18" (1/1) ... [2018-06-22 00:55:18,239 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:18" (1/1) ... [2018-06-22 00:55:18,242 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 00:55:18,243 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 00:55:18,243 INFO ]: Initializing RCFGBuilder... [2018-06-22 00:55:18,243 INFO ]: RCFGBuilder initialized [2018-06-22 00:55:18,244 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55: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) [2018-06-22 00:55:18,257 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 00:55:18,257 INFO ]: Found specification of procedure gotoProc [2018-06-22 00:55:18,257 INFO ]: Found implementation of procedure gotoProc [2018-06-22 00:55:18,257 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 00:55:18,257 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 00:55:18,257 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:18,884 INFO ]: Using library mode [2018-06-22 00:55:18,885 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:55:18 BoogieIcfgContainer [2018-06-22 00:55:18,885 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 00:55:18,887 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 00:55:18,887 INFO ]: Initializing TraceAbstraction... [2018-06-22 00:55:18,893 INFO ]: TraceAbstraction initialized [2018-06-22 00:55:18,894 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:55:18" (1/3) ... [2018-06-22 00:55:18,894 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72651368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:55:18, skipping insertion in model container [2018-06-22 00:55:18,894 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:18" (2/3) ... [2018-06-22 00:55:18,895 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72651368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:55:18, skipping insertion in model container [2018-06-22 00:55:18,895 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:55:18" (3/3) ... [2018-06-22 00:55:18,897 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 00:55:18,906 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 00:55:18,915 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 00:55:18,964 INFO ]: Using default assertion order modulation [2018-06-22 00:55:18,964 INFO ]: Interprodecural is true [2018-06-22 00:55:18,964 INFO ]: Hoare is false [2018-06-22 00:55:18,964 INFO ]: Compute interpolants for FPandBP [2018-06-22 00:55:18,965 INFO ]: Backedges is TWOTRACK [2018-06-22 00:55:18,965 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 00:55:18,965 INFO ]: Difference is false [2018-06-22 00:55:18,965 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 00:55:18,965 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 00:55:18,983 INFO ]: Start isEmpty. Operand 30 states. [2018-06-22 00:55:18,995 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 00:55:18,995 INFO ]: Found error trace [2018-06-22 00:55:18,996 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:18,996 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:19,001 INFO ]: Analyzing trace with hash 460847786, now seen corresponding path program 1 times [2018-06-22 00:55:19,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:19,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:19,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:19,041 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:19,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:19,125 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:20,293 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:20,295 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:20,295 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 00:55:20,296 INFO ]: Interpolant automaton has 13 states [2018-06-22 00:55:20,306 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 00:55:20,307 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 00:55:20,308 INFO ]: Start difference. First operand 30 states. Second operand 13 states. [2018-06-22 00:55:21,359 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:21,359 INFO ]: Finished difference Result 46 states and 52 transitions. [2018-06-22 00:55:21,360 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 00:55:21,360 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 00:55:21,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:21,369 INFO ]: With dead ends: 46 [2018-06-22 00:55:21,369 INFO ]: Without dead ends: 43 [2018-06-22 00:55:21,372 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2018-06-22 00:55:21,397 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 00:55:21,414 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-06-22 00:55:21,416 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 00:55:21,417 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-06-22 00:55:21,418 INFO ]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-06-22 00:55:21,418 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:21,418 INFO ]: Abstraction has 32 states and 36 transitions. [2018-06-22 00:55:21,418 INFO ]: Interpolant automaton has 13 states. [2018-06-22 00:55:21,418 INFO ]: Start isEmpty. Operand 32 states and 36 transitions. [2018-06-22 00:55:21,419 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 00:55:21,419 INFO ]: Found error trace [2018-06-22 00:55:21,419 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] [2018-06-22 00:55:21,419 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:21,419 INFO ]: Analyzing trace with hash 639587738, now seen corresponding path program 1 times [2018-06-22 00:55:21,419 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:21,419 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:21,420 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:21,420 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:21,420 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:21,461 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:21,966 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:21,967 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:21,967 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 00:55:21,972 INFO ]: Interpolant automaton has 10 states [2018-06-22 00:55:21,972 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 00:55:21,972 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 00:55:21,972 INFO ]: Start difference. First operand 32 states and 36 transitions. Second operand 10 states. [2018-06-22 00:55:22,380 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:22,380 INFO ]: Finished difference Result 80 states and 93 transitions. [2018-06-22 00:55:22,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 00:55:22,382 INFO ]: Start accepts. Automaton has 10 states. Word has length 27 [2018-06-22 00:55:22,382 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:22,386 INFO ]: With dead ends: 80 [2018-06-22 00:55:22,386 INFO ]: Without dead ends: 79 [2018-06-22 00:55:22,387 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2018-06-22 00:55:22,388 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 00:55:22,396 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 35. [2018-06-22 00:55:22,397 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 00:55:22,397 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-06-22 00:55:22,398 INFO ]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2018-06-22 00:55:22,398 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:22,398 INFO ]: Abstraction has 35 states and 39 transitions. [2018-06-22 00:55:22,398 INFO ]: Interpolant automaton has 10 states. [2018-06-22 00:55:22,398 INFO ]: Start isEmpty. Operand 35 states and 39 transitions. [2018-06-22 00:55:22,399 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 00:55:22,399 INFO ]: Found error trace [2018-06-22 00:55:22,399 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] [2018-06-22 00:55:22,399 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:22,399 INFO ]: Analyzing trace with hash 310947162, now seen corresponding path program 1 times [2018-06-22 00:55:22,399 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:22,399 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:22,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:22,401 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:22,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:22,458 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:22,648 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:22,648 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:22,648 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 00:55:22,648 INFO ]: Interpolant automaton has 10 states [2018-06-22 00:55:22,648 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 00:55:22,648 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 00:55:22,648 INFO ]: Start difference. First operand 35 states and 39 transitions. Second operand 10 states. [2018-06-22 00:55:22,846 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:22,846 INFO ]: Finished difference Result 46 states and 51 transitions. [2018-06-22 00:55:22,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 00:55:22,848 INFO ]: Start accepts. Automaton has 10 states. Word has length 27 [2018-06-22 00:55:22,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:22,849 INFO ]: With dead ends: 46 [2018-06-22 00:55:22,849 INFO ]: Without dead ends: 42 [2018-06-22 00:55:22,849 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 00:55:22,849 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 00:55:22,852 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-06-22 00:55:22,852 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 00:55:22,852 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-22 00:55:22,853 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 27 [2018-06-22 00:55:22,853 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:22,853 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-22 00:55:22,853 INFO ]: Interpolant automaton has 10 states. [2018-06-22 00:55:22,853 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-22 00:55:22,853 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 00:55:22,853 INFO ]: Found error trace [2018-06-22 00:55:22,854 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:22,854 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:22,854 INFO ]: Analyzing trace with hash 1446530137, now seen corresponding path program 1 times [2018-06-22 00:55:22,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:22,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:22,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:22,855 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:22,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:22,887 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:22,970 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:22,970 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:22,970 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:22,970 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:22,970 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:22,970 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:22,970 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 11 states. [2018-06-22 00:55:23,465 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:23,465 INFO ]: Finished difference Result 110 states and 128 transitions. [2018-06-22 00:55:23,465 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 00:55:23,465 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 00:55:23,466 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:23,467 INFO ]: With dead ends: 110 [2018-06-22 00:55:23,467 INFO ]: Without dead ends: 109 [2018-06-22 00:55:23,468 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=682, Unknown=0, NotChecked=0, Total=930 [2018-06-22 00:55:23,468 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-22 00:55:23,473 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 36. [2018-06-22 00:55:23,473 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 00:55:23,474 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-06-22 00:55:23,474 INFO ]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 28 [2018-06-22 00:55:23,475 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:23,475 INFO ]: Abstraction has 36 states and 40 transitions. [2018-06-22 00:55:23,475 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:23,475 INFO ]: Start isEmpty. Operand 36 states and 40 transitions. [2018-06-22 00:55:23,475 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 00:55:23,475 INFO ]: Found error trace [2018-06-22 00:55:23,475 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:23,476 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:23,476 INFO ]: Analyzing trace with hash 1117889561, now seen corresponding path program 1 times [2018-06-22 00:55:23,476 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:23,476 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:23,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:23,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:23,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:23,496 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:23,706 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:23,706 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:23,706 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:23,707 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:23,707 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:23,707 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:23,707 INFO ]: Start difference. First operand 36 states and 40 transitions. Second operand 11 states. [2018-06-22 00:55:23,982 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:23,982 INFO ]: Finished difference Result 60 states and 67 transitions. [2018-06-22 00:55:23,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 00:55:23,983 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 00:55:23,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:23,984 INFO ]: With dead ends: 60 [2018-06-22 00:55:23,984 INFO ]: Without dead ends: 56 [2018-06-22 00:55:23,985 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:23,985 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 00:55:23,988 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 33. [2018-06-22 00:55:23,988 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 00:55:23,989 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-06-22 00:55:23,989 INFO ]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2018-06-22 00:55:23,989 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:23,989 INFO ]: Abstraction has 33 states and 36 transitions. [2018-06-22 00:55:23,989 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:23,989 INFO ]: Start isEmpty. Operand 33 states and 36 transitions. [2018-06-22 00:55:23,990 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 00:55:23,990 INFO ]: Found error trace [2018-06-22 00:55:23,990 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:23,990 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:23,990 INFO ]: Analyzing trace with hash -854401895, now seen corresponding path program 1 times [2018-06-22 00:55:23,990 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:23,990 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:23,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:23,991 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:23,991 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:24,007 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:24,107 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:24,107 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:24,107 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:24,107 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:24,108 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:24,108 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:24,108 INFO ]: Start difference. First operand 33 states and 36 transitions. Second operand 11 states. [2018-06-22 00:55:24,327 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:24,327 INFO ]: Finished difference Result 87 states and 100 transitions. [2018-06-22 00:55:24,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 00:55:24,328 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 00:55:24,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:24,329 INFO ]: With dead ends: 87 [2018-06-22 00:55:24,329 INFO ]: Without dead ends: 86 [2018-06-22 00:55:24,330 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2018-06-22 00:55:24,330 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 00:55:24,333 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 36. [2018-06-22 00:55:24,333 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 00:55:24,334 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-06-22 00:55:24,334 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 28 [2018-06-22 00:55:24,334 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:24,334 INFO ]: Abstraction has 36 states and 39 transitions. [2018-06-22 00:55:24,334 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:24,334 INFO ]: Start isEmpty. Operand 36 states and 39 transitions. [2018-06-22 00:55:24,335 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 00:55:24,335 INFO ]: Found error trace [2018-06-22 00:55:24,335 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:24,335 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:24,335 INFO ]: Analyzing trace with hash -1183042471, now seen corresponding path program 1 times [2018-06-22 00:55:24,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:24,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:24,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:24,336 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:24,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:24,352 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:24,547 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:24,547 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:24,547 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:24,547 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:24,547 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:24,547 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:24,548 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 11 states. [2018-06-22 00:55:24,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:24,644 INFO ]: Finished difference Result 17 states and 16 transitions. [2018-06-22 00:55:24,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 00:55:24,644 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 00:55:24,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:24,645 INFO ]: With dead ends: 17 [2018-06-22 00:55:24,645 INFO ]: Without dead ends: 0 [2018-06-22 00:55:24,645 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 00:55:24,645 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 00:55:24,645 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 00:55:24,645 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 00:55:24,645 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 00:55:24,645 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-06-22 00:55:24,645 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:24,645 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 00:55:24,645 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:24,645 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 00:55:24,646 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 00:55:24,650 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:55:24 BoogieIcfgContainer [2018-06-22 00:55:24,650 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 00:55:24,651 INFO ]: Toolchain (without parser) took 6554.31 ms. Allocated memory was 304.1 MB in the beginning and 379.6 MB in the end (delta: 75.5 MB). Free memory was 245.5 MB in the beginning and 187.1 MB in the end (delta: 58.3 MB). Peak memory consumption was 133.8 MB. Max. memory is 3.6 GB. [2018-06-22 00:55:24,653 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 00:55:24,653 INFO ]: ChcToBoogie took 107.46 ms. Allocated memory is still 304.1 MB. Free memory was 245.5 MB in the beginning and 242.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:55:24,653 INFO ]: Boogie Preprocessor took 31.63 ms. Allocated memory is still 304.1 MB. Free memory was 242.5 MB in the beginning and 241.5 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-22 00:55:24,654 INFO ]: RCFGBuilder took 642.33 ms. Allocated memory is still 304.1 MB. Free memory was 241.5 MB in the beginning and 211.4 MB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 3.6 GB. [2018-06-22 00:55:24,654 INFO ]: TraceAbstraction took 5763.64 ms. Allocated memory was 304.1 MB in the beginning and 379.6 MB in the end (delta: 75.5 MB). Free memory was 210.4 MB in the beginning and 187.1 MB in the end (delta: 23.3 MB). Peak memory consumption was 98.8 MB. Max. memory is 3.6 GB. [2018-06-22 00:55:24,657 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 107.46 ms. Allocated memory is still 304.1 MB. Free memory was 245.5 MB in the beginning and 242.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 31.63 ms. Allocated memory is still 304.1 MB. Free memory was 242.5 MB in the beginning and 241.5 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 642.33 ms. Allocated memory is still 304.1 MB. Free memory was 241.5 MB in the beginning and 211.4 MB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5763.64 ms. Allocated memory was 304.1 MB in the beginning and 379.6 MB in the end (delta: 75.5 MB). Free memory was 210.4 MB in the beginning and 187.1 MB in the end (delta: 23.3 MB). Peak memory consumption was 98.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. SAFE Result, 5.6s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 177 SDtfs, 964 SDslu, 1524 SDs, 0 SdLazy, 444 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=4, 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, 211 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 8952 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/05.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_00-55-24-666.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/05.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_00-55-24-666.csv Received shutdown request...