java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.21.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:26:11,858 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:26:11,860 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:26:11,873 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:26:11,873 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:26:11,874 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:26:11,876 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:26:11,877 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:26:11,879 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:26:11,880 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:26:11,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:26:11,881 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:26:11,881 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:26:11,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:26:11,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:26:11,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:26:11,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:26:11,886 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:26:11,888 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:26:11,890 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:26:11,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:26:11,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:26:11,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:26:11,895 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:26:11,895 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:26:11,896 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:26:11,897 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:26:11,898 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:26:11,898 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:26:11,899 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:26:11,900 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:26:11,900 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:26:11,901 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:26:11,901 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:26:11,902 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:26:11,902 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:26:11,903 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:26:11,917 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:26:11,917 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:26:11,917 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:26:11,917 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:26:11,918 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:26:11,919 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:26:11,919 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:26:11,919 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:26:11,919 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:26:11,920 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:26:11,920 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:26:11,920 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:26:11,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:26:11,920 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:26:11,921 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:26:11,921 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:26:11,921 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:26:11,921 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:26:11,921 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:26:11,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:26:11,922 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:26:11,924 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:26:11,924 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:26:11,964 INFO ]: Repository-Root is: /tmp [2018-06-26 17:26:11,980 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:26:11,985 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:26:11,986 INFO ]: Initializing SmtParser... [2018-06-26 17:26:11,986 INFO ]: SmtParser initialized [2018-06-26 17:26:11,987 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.21.smt2 [2018-06-26 17:26:11,988 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-26 17:26:12,079 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.21.smt2 unknown [2018-06-26 17:26:12,791 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.21.smt2 [2018-06-26 17:26:12,796 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:26:12,806 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:26:12,806 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:26:12,806 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:26:12,806 INFO ]: ChcToBoogie initialized [2018-06-26 17:26:12,810 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:26:12" (1/1) ... [2018-06-26 17:26:12,972 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:26:12 Unit [2018-06-26 17:26:12,972 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:26:12,973 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:26:12,973 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:26:12,973 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:26:12,995 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:26:12" (1/1) ... [2018-06-26 17:26:12,995 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:26:12" (1/1) ... [2018-06-26 17:26:13,022 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:26:12" (1/1) ... [2018-06-26 17:26:13,022 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:26:12" (1/1) ... [2018-06-26 17:26:13,043 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:26:12" (1/1) ... [2018-06-26 17:26:13,048 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:26:12" (1/1) ... [2018-06-26 17:26:13,053 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:26:12" (1/1) ... [2018-06-26 17:26:13,060 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:26:13,060 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:26:13,060 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:26:13,060 INFO ]: RCFGBuilder initialized [2018-06-26 17:26:13,061 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:26:12" (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-26 17:26:13,073 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:26:13,073 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:26:13,073 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:26:13,073 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:26:13,073 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:26:13,073 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-26 17:26:14,988 INFO ]: Using library mode [2018-06-26 17:26:14,993 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:26:14 BoogieIcfgContainer [2018-06-26 17:26:14,993 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:26:14,993 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:26:14,993 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:26:14,994 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:26:14,995 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:26:14" (1/1) ... [2018-06-26 17:26:15,044 INFO ]: Initial Icfg 147 locations, 285 edges [2018-06-26 17:26:15,045 INFO ]: Using Remove infeasible edges [2018-06-26 17:26:15,045 INFO ]: Using Maximize final states [2018-06-26 17:26:15,046 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:26:15,046 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:26:15,049 INFO ]: Using Remove sink states [2018-06-26 17:26:15,050 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:26:15,050 INFO ]: Using Use SBE [2018-06-26 17:26:15,066 INFO ]: SBE split 0 edges [2018-06-26 17:26:15,074 INFO ]: Removed 4 edges and 2 locations because of local infeasibility [2018-06-26 17:26:15,079 INFO ]: 0 new accepting states [2018-06-26 17:26:15,764 INFO ]: Removed 49 edges and 8 locations by large block encoding [2018-06-26 17:26:15,767 INFO ]: Removed 5 edges and 2 locations by removing sink states [2018-06-26 17:26:15,772 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:26:15,772 INFO ]: 0 new accepting states [2018-06-26 17:26:15,776 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:26:15,777 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:26:15,782 INFO ]: Encoded RCFG 135 locations, 268 edges [2018-06-26 17:26:15,783 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:26:15 BasicIcfg [2018-06-26 17:26:15,783 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:26:15,785 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:26:15,785 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:26:15,789 INFO ]: TraceAbstraction initialized [2018-06-26 17:26:15,789 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:26:12" (1/4) ... [2018-06-26 17:26:15,790 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc47b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:26:15, skipping insertion in model container [2018-06-26 17:26:15,790 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:26:12" (2/4) ... [2018-06-26 17:26:15,790 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc47b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:26:15, skipping insertion in model container [2018-06-26 17:26:15,790 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:26:14" (3/4) ... [2018-06-26 17:26:15,791 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc47b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:26:15, skipping insertion in model container [2018-06-26 17:26:15,791 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:26:15" (4/4) ... [2018-06-26 17:26:15,794 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:26:15,801 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:26:15,808 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:26:15,848 INFO ]: Using default assertion order modulation [2018-06-26 17:26:15,849 INFO ]: Interprodecural is true [2018-06-26 17:26:15,849 INFO ]: Hoare is false [2018-06-26 17:26:15,849 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:26:15,849 INFO ]: Backedges is TWOTRACK [2018-06-26 17:26:15,849 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:26:15,849 INFO ]: Difference is false [2018-06-26 17:26:15,849 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:26:15,849 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:26:15,863 INFO ]: Start isEmpty. Operand 135 states. [2018-06-26 17:26:15,906 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:26:15,907 INFO ]: Found error trace [2018-06-26 17:26:15,908 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:26:15,908 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:26:15,914 INFO ]: Analyzing trace with hash 177902743, now seen corresponding path program 1 times [2018-06-26 17:26:15,916 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:26:15,916 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:26:15,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:26:15,966 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:26:15,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:26:16,104 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:26:16,321 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:26:16,324 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:26:16,324 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:26:16,326 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:26:16,341 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:26:16,342 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:26:16,344 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-26 17:26:18,869 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:26:18,869 INFO ]: Finished difference Result 267 states and 532 transitions. [2018-06-26 17:26:18,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:26:18,872 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:26:18,873 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:26:18,916 INFO ]: With dead ends: 267 [2018-06-26 17:26:18,916 INFO ]: Without dead ends: 267 [2018-06-26 17:26:18,917 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-26 17:26:18,936 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-26 17:26:19,043 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-26 17:26:19,044 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-26 17:26:19,066 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 532 transitions. [2018-06-26 17:26:19,068 INFO ]: Start accepts. Automaton has 267 states and 532 transitions. Word has length 5 [2018-06-26 17:26:19,068 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:26:19,068 INFO ]: Abstraction has 267 states and 532 transitions. [2018-06-26 17:26:19,068 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:26:19,069 INFO ]: Start isEmpty. Operand 267 states and 532 transitions. [2018-06-26 17:26:19,080 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:26:19,080 INFO ]: Found error trace [2018-06-26 17:26:19,080 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:26:19,080 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:26:19,080 INFO ]: Analyzing trace with hash 177965208, now seen corresponding path program 1 times [2018-06-26 17:26:19,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:26:19,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:26:19,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:26:19,081 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:26:19,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:26:19,106 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:26:19,240 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:26:19,240 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:26:19,240 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:26:19,242 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:26:19,242 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:26:19,242 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:26:19,242 INFO ]: Start difference. First operand 267 states and 532 transitions. Second operand 3 states. [2018-06-26 17:26:20,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:26:20,658 INFO ]: Finished difference Result 399 states and 797 transitions. [2018-06-26 17:26:20,659 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:26:20,659 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:26:20,659 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:26:20,688 INFO ]: With dead ends: 399 [2018-06-26 17:26:20,688 INFO ]: Without dead ends: 399 [2018-06-26 17:26:20,689 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-26 17:26:20,690 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-26 17:26:20,763 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-06-26 17:26:20,763 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-26 17:26:20,792 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 797 transitions. [2018-06-26 17:26:20,792 INFO ]: Start accepts. Automaton has 399 states and 797 transitions. Word has length 5 [2018-06-26 17:26:20,792 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:26:20,792 INFO ]: Abstraction has 399 states and 797 transitions. [2018-06-26 17:26:20,792 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:26:20,792 INFO ]: Start isEmpty. Operand 399 states and 797 transitions. [2018-06-26 17:26:20,823 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:26:20,823 INFO ]: Found error trace [2018-06-26 17:26:20,823 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:26:20,823 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:26:20,823 INFO ]: Analyzing trace with hash 720566082, now seen corresponding path program 1 times [2018-06-26 17:26:20,823 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:26:20,823 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:26:20,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:26:20,824 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:26:20,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:26:20,852 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:26:20,967 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:26:20,967 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:26:20,967 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:26:20,967 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:26:20,967 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:26:20,967 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:26:20,967 INFO ]: Start difference. First operand 399 states and 797 transitions. Second operand 3 states. [2018-06-26 17:26:22,959 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:26:22,959 INFO ]: Finished difference Result 531 states and 1061 transitions. [2018-06-26 17:26:22,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:26:22,959 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 17:26:22,960 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:26:22,997 INFO ]: With dead ends: 531 [2018-06-26 17:26:22,997 INFO ]: Without dead ends: 531 [2018-06-26 17:26:22,997 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-26 17:26:22,997 INFO ]: Start minimizeSevpa. Operand 531 states. [2018-06-26 17:26:23,100 INFO ]: Finished minimizeSevpa. Reduced states from 531 to 531. [2018-06-26 17:26:23,100 INFO ]: Start removeUnreachable. Operand 531 states. [2018-06-26 17:26:23,116 INFO ]: Finished removeUnreachable. Reduced from 531 states to 531 states and 1061 transitions. [2018-06-26 17:26:23,116 INFO ]: Start accepts. Automaton has 531 states and 1061 transitions. Word has length 10 [2018-06-26 17:26:23,116 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:26:23,116 INFO ]: Abstraction has 531 states and 1061 transitions. [2018-06-26 17:26:23,116 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:26:23,116 INFO ]: Start isEmpty. Operand 531 states and 1061 transitions. [2018-06-26 17:26:23,155 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:26:23,155 INFO ]: Found error trace [2018-06-26 17:26:23,155 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:26:23,155 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:26:23,155 INFO ]: Analyzing trace with hash -1377641540, now seen corresponding path program 1 times [2018-06-26 17:26:23,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:26:23,156 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:26:23,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:26:23,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:26:23,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:26:23,201 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:26:23,605 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:26:23,605 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:26:23,605 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:26:23,605 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:26:23,605 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:26:23,605 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:26:23,605 INFO ]: Start difference. First operand 531 states and 1061 transitions. Second operand 6 states. [2018-06-26 17:26:28,880 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:26:28,880 INFO ]: Finished difference Result 1643 states and 5329 transitions. [2018-06-26 17:26:28,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:26:28,881 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:26:28,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:26:29,191 INFO ]: With dead ends: 1643 [2018-06-26 17:26:29,191 INFO ]: Without dead ends: 1471 [2018-06-26 17:26:29,191 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:26:29,192 INFO ]: Start minimizeSevpa. Operand 1471 states. [2018-06-26 17:26:29,663 INFO ]: Finished minimizeSevpa. Reduced states from 1471 to 902. [2018-06-26 17:26:29,663 INFO ]: Start removeUnreachable. Operand 902 states. [2018-06-26 17:26:29,694 INFO ]: Finished removeUnreachable. Reduced from 902 states to 902 states and 2014 transitions. [2018-06-26 17:26:29,694 INFO ]: Start accepts. Automaton has 902 states and 2014 transitions. Word has length 10 [2018-06-26 17:26:29,694 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:26:29,694 INFO ]: Abstraction has 902 states and 2014 transitions. [2018-06-26 17:26:29,694 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:26:29,694 INFO ]: Start isEmpty. Operand 902 states and 2014 transitions. [2018-06-26 17:26:29,743 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:26:29,743 INFO ]: Found error trace [2018-06-26 17:26:29,743 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:26:29,743 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:26:29,745 INFO ]: Analyzing trace with hash -597448216, now seen corresponding path program 1 times [2018-06-26 17:26:29,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:26:29,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:26:29,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:26:29,745 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:26:29,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:26:29,780 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:26:30,207 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:26:30,207 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:26:30,207 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:26:30,207 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:26:30,207 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:26:30,207 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:26:30,207 INFO ]: Start difference. First operand 902 states and 2014 transitions. Second operand 6 states. [2018-06-26 17:26:36,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:26:36,010 INFO ]: Finished difference Result 2336 states and 9550 transitions. [2018-06-26 17:26:36,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:26:36,010 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:26:36,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:26:36,366 INFO ]: With dead ends: 2336 [2018-06-26 17:26:36,366 INFO ]: Without dead ends: 2336 [2018-06-26 17:26:36,366 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:26:36,367 INFO ]: Start minimizeSevpa. Operand 2336 states. [2018-06-26 17:26:37,255 INFO ]: Finished minimizeSevpa. Reduced states from 2336 to 1441. [2018-06-26 17:26:37,255 INFO ]: Start removeUnreachable. Operand 1441 states. [2018-06-26 17:26:37,342 INFO ]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 4061 transitions. [2018-06-26 17:26:37,342 INFO ]: Start accepts. Automaton has 1441 states and 4061 transitions. Word has length 10 [2018-06-26 17:26:37,342 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:26:37,342 INFO ]: Abstraction has 1441 states and 4061 transitions. [2018-06-26 17:26:37,342 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:26:37,342 INFO ]: Start isEmpty. Operand 1441 states and 4061 transitions. [2018-06-26 17:26:37,410 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:26:37,410 INFO ]: Found error trace [2018-06-26 17:26:37,410 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:26:37,410 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:26:37,410 INFO ]: Analyzing trace with hash -482931612, now seen corresponding path program 1 times [2018-06-26 17:26:37,410 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:26:37,410 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:26:37,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:26:37,411 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:26:37,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:26:37,442 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:26:37,849 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:26:37,849 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:26:37,849 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 17:26:37,849 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:26:37,849 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:26:37,849 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:26:37,849 INFO ]: Start difference. First operand 1441 states and 4061 transitions. Second operand 6 states. [2018-06-26 17:26:42,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:26:42,911 INFO ]: Finished difference Result 3260 states and 14985 transitions. [2018-06-26 17:26:42,911 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:26:42,911 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 17:26:42,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:26:43,290 INFO ]: With dead ends: 3260 [2018-06-26 17:26:43,290 INFO ]: Without dead ends: 3260 [2018-06-26 17:26:43,291 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:26:43,292 INFO ]: Start minimizeSevpa. Operand 3260 states. [2018-06-26 17:26:44,540 INFO ]: Finished minimizeSevpa. Reduced states from 3260 to 1441. [2018-06-26 17:26:44,540 INFO ]: Start removeUnreachable. Operand 1441 states. [2018-06-26 17:26:44,620 INFO ]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 4061 transitions. [2018-06-26 17:26:44,620 INFO ]: Start accepts. Automaton has 1441 states and 4061 transitions. Word has length 10 [2018-06-26 17:26:44,620 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:26:44,620 INFO ]: Abstraction has 1441 states and 4061 transitions. [2018-06-26 17:26:44,620 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:26:44,621 INFO ]: Start isEmpty. Operand 1441 states and 4061 transitions. [2018-06-26 17:26:44,690 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:26:44,690 INFO ]: Found error trace [2018-06-26 17:26:44,690 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:26:44,690 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:26:44,691 INFO ]: Analyzing trace with hash 236117187, now seen corresponding path program 1 times [2018-06-26 17:26:44,691 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:26:44,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:26:44,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:26:44,691 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:26:44,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:26:44,738 INFO ]: Conjunction of SSA is sat [2018-06-26 17:26:44,746 INFO ]: Counterexample might be feasible [2018-06-26 17:26:44,758 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:26:44,759 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:26:44 BasicIcfg [2018-06-26 17:26:44,759 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:26:44,761 INFO ]: Toolchain (without parser) took 31964.87 ms. Allocated memory was 308.8 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 231.2 MB in the beginning and 868.9 MB in the end (delta: -637.6 MB). Peak memory consumption was 379.5 MB. Max. memory is 3.6 GB. [2018-06-26 17:26:44,763 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:26:44,763 INFO ]: ChcToBoogie took 166.44 ms. Allocated memory is still 308.8 MB. Free memory was 231.2 MB in the beginning and 226.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:26:44,763 INFO ]: Boogie Preprocessor took 86.68 ms. Allocated memory is still 308.8 MB. Free memory was 226.3 MB in the beginning and 223.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:26:44,764 INFO ]: RCFGBuilder took 1932.42 ms. Allocated memory was 308.8 MB in the beginning and 323.5 MB in the end (delta: 14.7 MB). Free memory was 223.3 MB in the beginning and 217.1 MB in the end (delta: 6.2 MB). Peak memory consumption was 41.1 MB. Max. memory is 3.6 GB. [2018-06-26 17:26:44,767 INFO ]: BlockEncodingV2 took 789.74 ms. Allocated memory was 323.5 MB in the beginning and 358.6 MB in the end (delta: 35.1 MB). Free memory was 217.1 MB in the beginning and 325.0 MB in the end (delta: -107.9 MB). Peak memory consumption was 43.6 MB. Max. memory is 3.6 GB. [2018-06-26 17:26:44,768 INFO ]: TraceAbstraction took 28974.95 ms. Allocated memory was 358.6 MB in the beginning and 1.3 GB in the end (delta: 967.3 MB). Free memory was 325.0 MB in the beginning and 868.9 MB in the end (delta: -543.9 MB). Peak memory consumption was 423.4 MB. Max. memory is 3.6 GB. [2018-06-26 17:26:44,770 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 147 locations, 285 edges - StatisticsResult: Encoded RCFG 135 locations, 268 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 166.44 ms. Allocated memory is still 308.8 MB. Free memory was 231.2 MB in the beginning and 226.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 86.68 ms. Allocated memory is still 308.8 MB. Free memory was 226.3 MB in the beginning and 223.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1932.42 ms. Allocated memory was 308.8 MB in the beginning and 323.5 MB in the end (delta: 14.7 MB). Free memory was 223.3 MB in the beginning and 217.1 MB in the end (delta: 6.2 MB). Peak memory consumption was 41.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 789.74 ms. Allocated memory was 323.5 MB in the beginning and 358.6 MB in the end (delta: 35.1 MB). Free memory was 217.1 MB in the beginning and 325.0 MB in the end (delta: -107.9 MB). Peak memory consumption was 43.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 28974.95 ms. Allocated memory was 358.6 MB in the beginning and 1.3 GB in the end (delta: 967.3 MB). Free memory was 325.0 MB in the beginning and 868.9 MB in the end (delta: -543.9 MB). Peak memory consumption was 423.4 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assume true; [L0] CALL call gotoProc(4, hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Int, hbv_False_14_Int); [L0] COND TRUE gotoSwitch == 4 [L0] hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_8_Int, hhv_step_lturn_9_Int, hhv_step_lturn_10_Int, hhv_step_lturn_11_Int, hhv_step_lturn_12_Int, hhv_step_lturn_13_Int := gpav_0_Int, gpav_1_Int, gpav_2_Int, gpav_3_Int, gpav_4_Int, gpav_5_Int, gpav_6_Int, gpav_7_Int, gpav_8_Int, gpav_9_Int, gpav_10_Int, gpav_11_Int, gpav_12_Int, gpav_13_Int; [L0] RET call gotoProc(4, hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Int, hbv_False_14_Int); [L0] hhv_combined_lturn_0_Int, hhv_combined_lturn_1_Int, hhv_combined_lturn_2_Int, hhv_combined_lturn_3_Int, hhv_combined_lturn_4_Int, hhv_combined_lturn_5_Int, hhv_combined_lturn_6_Int, hhv_combined_lturn_7_Int, hhv_combined_lturn_8_Int, hhv_combined_lturn_9_Int, hhv_combined_lturn_10_Int, hhv_combined_lturn_11_Int, hhv_combined_lturn_12_Int, hhv_combined_lturn_13_Int := hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_13_Int, hbv_False_12_Int, hbv_False_14_Int; [L0] havoc hbv_False_6_Int, hbv_False_7_Int, hbv_False_3_Int, hbv_False_5_Int, hbv_False_8_Int, hbv_False_13_Int, hbv_False_2_Int, hbv_False_4_Int, hbv_False_9_Int, hbv_False_14_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_10_Int, hbv_False_1_Int; [L0] assume true; [L0] hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_8_Int, hhv_step_lturn_9_Int, hhv_step_lturn_10_Int, hhv_step_lturn_11_Int, hhv_step_lturn_12_Int, hhv_step_lturn_13_Int := hhv_combined_lturn_0_Int, hhv_combined_lturn_1_Int, hhv_combined_lturn_2_Int, hhv_combined_lturn_3_Int, hhv_combined_lturn_4_Int, hhv_combined_lturn_5_Int, hhv_combined_lturn_6_Int, hhv_combined_lturn_7_Int, hhv_combined_lturn_8_Int, hhv_combined_lturn_9_Int, hhv_combined_lturn_10_Int, hhv_combined_lturn_11_Int, hhv_combined_lturn_12_Int, hhv_combined_lturn_13_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. UNSAFE Result, 28.9s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 23.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3706 SDtfs, 775 SDslu, 5915 SDs, 0 SdLazy, 8871 SolverSat, 2653 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1441occurred in iteration=5, 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: 3.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3283 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 9/9 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/fortune-full-nonrobust.21.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-26-44-785.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.21.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-26-44-785.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.21.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-26-44-785.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.21.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-26-44-785.csv Received shutdown request...