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/vmt-chc-benchmarks/cav12/simple_array_inversion-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:50:44,849 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:50:44,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:50:44,865 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:50:44,865 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:50:44,866 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:50:44,867 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:50:44,869 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:50:44,870 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:50:44,871 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:50:44,872 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:50:44,872 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:50:44,873 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:50:44,874 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:50:44,877 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:50:44,877 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:50:44,878 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:50:44,882 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:50:44,884 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:50:44,885 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:50:44,886 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:50:44,887 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:50:44,889 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:50:44,890 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:50:44,890 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:50:44,891 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:50:44,892 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:50:44,892 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:50:44,893 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:50:44,894 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:50:44,895 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:50:44,895 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:50:44,895 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:50:44,896 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:50:44,896 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:50:44,897 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:50:44,897 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 20:50:44,918 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:50:44,918 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:50:44,919 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:50:44,919 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:50:44,920 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:50:44,920 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:50:44,920 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:50:44,921 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:50:44,921 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:50:44,921 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:50:44,921 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:50:44,921 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:50:44,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:50:44,922 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:50:44,922 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:50:44,922 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:50:44,923 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:50:44,923 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:50:44,923 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:50:44,923 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:50:44,923 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:50:44,925 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:50:44,925 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:50:44,978 INFO ]: Repository-Root is: /tmp [2018-06-26 20:50:44,995 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:50:45,001 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:50:45,002 INFO ]: Initializing SmtParser... [2018-06-26 20:50:45,003 INFO ]: SmtParser initialized [2018-06-26 20:50:45,003 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/simple_array_inversion-1.smt2 [2018-06-26 20:50:45,004 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 20:50:45,095 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/simple_array_inversion-1.smt2 unknown [2018-06-26 20:50:45,566 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/simple_array_inversion-1.smt2 [2018-06-26 20:50:45,570 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:50:45,580 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:50:45,580 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:50:45,580 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:50:45,580 INFO ]: ChcToBoogie initialized [2018-06-26 20:50:45,593 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:50:45" (1/1) ... [2018-06-26 20:50:45,713 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:45 Unit [2018-06-26 20:50:45,713 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:50:45,716 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:50:45,716 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:50:45,716 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:50:45,737 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:45" (1/1) ... [2018-06-26 20:50:45,737 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:45" (1/1) ... [2018-06-26 20:50:45,759 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:45" (1/1) ... [2018-06-26 20:50:45,759 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:45" (1/1) ... [2018-06-26 20:50:45,777 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:45" (1/1) ... [2018-06-26 20:50:45,779 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:45" (1/1) ... [2018-06-26 20:50:45,786 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:45" (1/1) ... [2018-06-26 20:50:45,790 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:50:45,791 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:50:45,791 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:50:45,791 INFO ]: RCFGBuilder initialized [2018-06-26 20:50:45,791 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:45" (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 20:50:45,810 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:50:45,810 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:50:45,811 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:50:45,811 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:50:45,811 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:50:45,811 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 20:50:46,189 INFO ]: Using library mode [2018-06-26 20:50:46,189 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:50:46 BoogieIcfgContainer [2018-06-26 20:50:46,189 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:50:46,190 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:50:46,193 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:50:46,194 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:50:46,195 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:50:46" (1/1) ... [2018-06-26 20:50:46,209 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:50:46,211 INFO ]: Using Remove infeasible edges [2018-06-26 20:50:46,212 INFO ]: Using Maximize final states [2018-06-26 20:50:46,212 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:50:46,212 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:50:46,214 INFO ]: Using Remove sink states [2018-06-26 20:50:46,215 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:50:46,215 INFO ]: Using Use SBE [2018-06-26 20:50:51,617 INFO ]: SBE split 1 edges [2018-06-26 20:50:52,319 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:50:52,323 INFO ]: 0 new accepting states [2018-06-26 20:50:52,402 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:50:52,406 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:50:53,970 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:50:53,972 INFO ]: 0 new accepting states [2018-06-26 20:50:53,974 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:50:53,974 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:50:55,069 INFO ]: Encoded RCFG 6 locations, 3922 edges [2018-06-26 20:50:55,070 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:50:55 BasicIcfg [2018-06-26 20:50:55,070 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:50:55,071 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:50:55,071 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:50:55,074 INFO ]: TraceAbstraction initialized [2018-06-26 20:50:55,074 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:50:45" (1/4) ... [2018-06-26 20:50:55,076 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b76b40b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:50:55, skipping insertion in model container [2018-06-26 20:50:55,076 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:45" (2/4) ... [2018-06-26 20:50:55,076 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b76b40b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:50:55, skipping insertion in model container [2018-06-26 20:50:55,076 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:50:46" (3/4) ... [2018-06-26 20:50:55,076 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b76b40b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:50:55, skipping insertion in model container [2018-06-26 20:50:55,076 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:50:55" (4/4) ... [2018-06-26 20:50:55,078 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:50:55,087 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:50:55,095 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:50:55,134 INFO ]: Using default assertion order modulation [2018-06-26 20:50:55,134 INFO ]: Interprodecural is true [2018-06-26 20:50:55,134 INFO ]: Hoare is false [2018-06-26 20:50:55,134 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:50:55,134 INFO ]: Backedges is TWOTRACK [2018-06-26 20:50:55,134 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:50:55,134 INFO ]: Difference is false [2018-06-26 20:50:55,134 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:50:55,134 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:50:55,157 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:50:55,178 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:50:55,179 INFO ]: Found error trace [2018-06-26 20:50:55,179 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:50:55,179 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:55,184 INFO ]: Analyzing trace with hash 155858146, now seen corresponding path program 1 times [2018-06-26 20:50:55,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:55,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:55,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:55,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:55,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:55,304 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:55,429 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:50:55,432 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:55,432 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:55,434 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:55,449 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:55,450 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:55,452 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:51:11,910 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:11,910 INFO ]: Finished difference Result 7 states and 56 transitions. [2018-06-26 20:51:11,911 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:11,912 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:51:11,913 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:11,921 INFO ]: With dead ends: 7 [2018-06-26 20:51:11,921 INFO ]: Without dead ends: 7 [2018-06-26 20:51:11,924 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 20:51:11,938 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:51:11,955 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:51:11,956 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:51:11,956 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-06-26 20:51:11,958 INFO ]: Start accepts. Automaton has 7 states and 56 transitions. Word has length 5 [2018-06-26 20:51:11,959 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:11,959 INFO ]: Abstraction has 7 states and 56 transitions. [2018-06-26 20:51:11,959 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:11,959 INFO ]: Start isEmpty. Operand 7 states and 56 transitions. [2018-06-26 20:51:11,959 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:51:11,959 INFO ]: Found error trace [2018-06-26 20:51:11,959 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:51:11,959 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:11,960 INFO ]: Analyzing trace with hash 473997409, now seen corresponding path program 1 times [2018-06-26 20:51:11,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:11,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:11,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:11,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:11,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:11,988 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:12,042 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:51:12,043 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:12,043 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:12,044 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:12,044 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:12,044 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:12,044 INFO ]: Start difference. First operand 7 states and 56 transitions. Second operand 3 states. [2018-06-26 20:51:12,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:12,257 INFO ]: Finished difference Result 9 states and 86 transitions. [2018-06-26 20:51:12,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:12,257 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:51:12,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:12,258 INFO ]: With dead ends: 9 [2018-06-26 20:51:12,258 INFO ]: Without dead ends: 9 [2018-06-26 20:51:12,258 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 20:51:12,258 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:51:12,261 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:51:12,261 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:51:12,261 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2018-06-26 20:51:12,261 INFO ]: Start accepts. Automaton has 9 states and 86 transitions. Word has length 6 [2018-06-26 20:51:12,261 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:12,261 INFO ]: Abstraction has 9 states and 86 transitions. [2018-06-26 20:51:12,261 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:12,261 INFO ]: Start isEmpty. Operand 9 states and 86 transitions. [2018-06-26 20:51:12,262 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:51:12,262 INFO ]: Found error trace [2018-06-26 20:51:12,262 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:51:12,262 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:12,262 INFO ]: Analyzing trace with hash 475069885, now seen corresponding path program 1 times [2018-06-26 20:51:12,262 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:12,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:12,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:12,263 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:12,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:12,289 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:12,318 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:51:12,318 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:12,318 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:12,318 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:12,318 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:12,318 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:12,318 INFO ]: Start difference. First operand 9 states and 86 transitions. Second operand 3 states. [2018-06-26 20:51:12,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:12,538 INFO ]: Finished difference Result 13 states and 119 transitions. [2018-06-26 20:51:12,538 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:12,538 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:51:12,538 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:12,539 INFO ]: With dead ends: 13 [2018-06-26 20:51:12,539 INFO ]: Without dead ends: 13 [2018-06-26 20:51:12,539 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 20:51:12,539 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:51:12,541 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 20:51:12,541 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:51:12,542 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2018-06-26 20:51:12,542 INFO ]: Start accepts. Automaton has 13 states and 119 transitions. Word has length 6 [2018-06-26 20:51:12,542 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:12,542 INFO ]: Abstraction has 13 states and 119 transitions. [2018-06-26 20:51:12,542 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:12,542 INFO ]: Start isEmpty. Operand 13 states and 119 transitions. [2018-06-26 20:51:12,543 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:51:12,543 INFO ]: Found error trace [2018-06-26 20:51:12,543 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:51:12,543 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:12,543 INFO ]: Analyzing trace with hash 500183698, now seen corresponding path program 1 times [2018-06-26 20:51:12,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:12,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:12,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:12,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:12,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:12,568 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:12,616 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:51:12,616 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:12,617 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:12,617 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:12,617 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:12,617 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:12,617 INFO ]: Start difference. First operand 13 states and 119 transitions. Second operand 3 states. [2018-06-26 20:51:12,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:12,758 INFO ]: Finished difference Result 13 states and 80 transitions. [2018-06-26 20:51:12,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:12,758 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:51:12,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:12,759 INFO ]: With dead ends: 13 [2018-06-26 20:51:12,759 INFO ]: Without dead ends: 13 [2018-06-26 20:51:12,759 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 20:51:12,759 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:51:12,762 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 20:51:12,762 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:51:12,762 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 80 transitions. [2018-06-26 20:51:12,762 INFO ]: Start accepts. Automaton has 13 states and 80 transitions. Word has length 6 [2018-06-26 20:51:12,762 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:12,762 INFO ]: Abstraction has 13 states and 80 transitions. [2018-06-26 20:51:12,762 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:12,762 INFO ]: Start isEmpty. Operand 13 states and 80 transitions. [2018-06-26 20:51:12,762 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:51:12,763 INFO ]: Found error trace [2018-06-26 20:51:12,763 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:12,763 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:12,763 INFO ]: Analyzing trace with hash 1270766655, now seen corresponding path program 1 times [2018-06-26 20:51:12,763 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:12,763 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:12,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:12,764 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:12,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:12,817 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:12,879 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:51:12,879 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:12,879 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:12,879 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:12,879 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:12,879 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:12,879 INFO ]: Start difference. First operand 13 states and 80 transitions. Second operand 3 states. [2018-06-26 20:51:13,057 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:13,057 INFO ]: Finished difference Result 14 states and 86 transitions. [2018-06-26 20:51:13,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:13,058 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:51:13,058 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:13,058 INFO ]: With dead ends: 14 [2018-06-26 20:51:13,058 INFO ]: Without dead ends: 14 [2018-06-26 20:51:13,059 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 20:51:13,059 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 20:51:13,061 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-26 20:51:13,061 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:51:13,061 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 80 transitions. [2018-06-26 20:51:13,061 INFO ]: Start accepts. Automaton has 13 states and 80 transitions. Word has length 7 [2018-06-26 20:51:13,061 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:13,061 INFO ]: Abstraction has 13 states and 80 transitions. [2018-06-26 20:51:13,062 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:13,062 INFO ]: Start isEmpty. Operand 13 states and 80 transitions. [2018-06-26 20:51:13,062 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:51:13,063 INFO ]: Found error trace [2018-06-26 20:51:13,063 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:13,063 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:13,063 INFO ]: Analyzing trace with hash -1736812367, now seen corresponding path program 1 times [2018-06-26 20:51:13,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:13,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:13,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:13,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:13,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:13,086 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:13,132 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:51:13,132 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:13,132 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:13,132 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:13,132 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:13,132 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:13,133 INFO ]: Start difference. First operand 13 states and 80 transitions. Second operand 3 states. [2018-06-26 20:51:13,255 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:13,255 INFO ]: Finished difference Result 13 states and 49 transitions. [2018-06-26 20:51:13,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:13,255 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:51:13,256 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:13,256 INFO ]: With dead ends: 13 [2018-06-26 20:51:13,256 INFO ]: Without dead ends: 13 [2018-06-26 20:51:13,256 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 20:51:13,256 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:51:13,258 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 20:51:13,258 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:51:13,258 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2018-06-26 20:51:13,258 INFO ]: Start accepts. Automaton has 13 states and 49 transitions. Word has length 7 [2018-06-26 20:51:13,258 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:13,258 INFO ]: Abstraction has 13 states and 49 transitions. [2018-06-26 20:51:13,258 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:13,259 INFO ]: Start isEmpty. Operand 13 states and 49 transitions. [2018-06-26 20:51:13,259 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:51:13,259 INFO ]: Found error trace [2018-06-26 20:51:13,259 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:13,259 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:13,259 INFO ]: Analyzing trace with hash 1969872052, now seen corresponding path program 1 times [2018-06-26 20:51:13,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:13,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:13,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:13,260 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:13,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:13,283 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:13,362 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:51:13,362 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:13,362 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:13,362 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:13,362 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:13,362 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:13,362 INFO ]: Start difference. First operand 13 states and 49 transitions. Second operand 3 states. [2018-06-26 20:51:13,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:13,497 INFO ]: Finished difference Result 15 states and 62 transitions. [2018-06-26 20:51:13,498 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:13,498 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:51:13,498 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:13,498 INFO ]: With dead ends: 15 [2018-06-26 20:51:13,498 INFO ]: Without dead ends: 15 [2018-06-26 20:51:13,498 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 20:51:13,499 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 20:51:13,500 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-26 20:51:13,500 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 20:51:13,501 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2018-06-26 20:51:13,501 INFO ]: Start accepts. Automaton has 14 states and 56 transitions. Word has length 7 [2018-06-26 20:51:13,501 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:13,501 INFO ]: Abstraction has 14 states and 56 transitions. [2018-06-26 20:51:13,501 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:13,501 INFO ]: Start isEmpty. Operand 14 states and 56 transitions. [2018-06-26 20:51:13,501 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:51:13,501 INFO ]: Found error trace [2018-06-26 20:51:13,501 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:13,502 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:13,503 INFO ]: Analyzing trace with hash 916727592, now seen corresponding path program 1 times [2018-06-26 20:51:13,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:13,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:13,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:13,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:13,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:13,520 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:13,592 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:51:13,593 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:13,593 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:13,593 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:13,593 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:13,593 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:13,593 INFO ]: Start difference. First operand 14 states and 56 transitions. Second operand 3 states. [2018-06-26 20:51:13,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:13,724 INFO ]: Finished difference Result 16 states and 70 transitions. [2018-06-26 20:51:13,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:13,724 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:51:13,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:13,725 INFO ]: With dead ends: 16 [2018-06-26 20:51:13,725 INFO ]: Without dead ends: 16 [2018-06-26 20:51:13,725 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 20:51:13,725 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 20:51:13,727 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-06-26 20:51:13,727 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 20:51:13,727 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2018-06-26 20:51:13,728 INFO ]: Start accepts. Automaton has 15 states and 64 transitions. Word has length 8 [2018-06-26 20:51:13,728 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:13,728 INFO ]: Abstraction has 15 states and 64 transitions. [2018-06-26 20:51:13,728 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:13,728 INFO ]: Start isEmpty. Operand 15 states and 64 transitions. [2018-06-26 20:51:13,728 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:51:13,728 INFO ]: Found error trace [2018-06-26 20:51:13,728 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:13,728 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:13,728 INFO ]: Analyzing trace with hash 1567470092, now seen corresponding path program 1 times [2018-06-26 20:51:13,728 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:13,728 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:13,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:13,729 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:13,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:13,767 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:13,913 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:51:13,913 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:13,913 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:13,913 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:13,913 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:13,913 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:13,913 INFO ]: Start difference. First operand 15 states and 64 transitions. Second operand 3 states. [2018-06-26 20:51:14,067 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:14,067 INFO ]: Finished difference Result 17 states and 76 transitions. [2018-06-26 20:51:14,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:14,067 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:51:14,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:14,068 INFO ]: With dead ends: 17 [2018-06-26 20:51:14,068 INFO ]: Without dead ends: 17 [2018-06-26 20:51:14,068 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:14,068 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 20:51:14,070 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-26 20:51:14,070 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 20:51:14,071 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2018-06-26 20:51:14,071 INFO ]: Start accepts. Automaton has 15 states and 63 transitions. Word has length 9 [2018-06-26 20:51:14,071 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:14,071 INFO ]: Abstraction has 15 states and 63 transitions. [2018-06-26 20:51:14,071 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:14,071 INFO ]: Start isEmpty. Operand 15 states and 63 transitions. [2018-06-26 20:51:14,071 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:51:14,071 INFO ]: Found error trace [2018-06-26 20:51:14,071 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:14,071 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:14,071 INFO ]: Analyzing trace with hash 1874401926, now seen corresponding path program 1 times [2018-06-26 20:51:14,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:14,071 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:14,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:14,072 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:14,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:14,088 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:14,153 INFO ]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:51:14,153 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:14,153 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:14,153 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:14,154 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:14,154 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:14,154 INFO ]: Start difference. First operand 15 states and 63 transitions. Second operand 3 states. [2018-06-26 20:51:14,343 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:14,343 INFO ]: Finished difference Result 19 states and 64 transitions. [2018-06-26 20:51:14,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:14,344 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:51:14,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:14,344 INFO ]: With dead ends: 19 [2018-06-26 20:51:14,344 INFO ]: Without dead ends: 17 [2018-06-26 20:51:14,344 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 20:51:14,345 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 20:51:14,347 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 20:51:14,347 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 20:51:14,348 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 60 transitions. [2018-06-26 20:51:14,348 INFO ]: Start accepts. Automaton has 17 states and 60 transitions. Word has length 9 [2018-06-26 20:51:14,348 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:14,348 INFO ]: Abstraction has 17 states and 60 transitions. [2018-06-26 20:51:14,348 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:14,348 INFO ]: Start isEmpty. Operand 17 states and 60 transitions. [2018-06-26 20:51:14,348 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:51:14,348 INFO ]: Found error trace [2018-06-26 20:51:14,348 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:14,348 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:14,348 INFO ]: Analyzing trace with hash 623728264, now seen corresponding path program 1 times [2018-06-26 20:51:14,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:14,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:14,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:14,349 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:14,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:14,373 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:14,455 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:51:14,455 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:14,455 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:14,455 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:14,455 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:14,455 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:14,456 INFO ]: Start difference. First operand 17 states and 60 transitions. Second operand 3 states. [2018-06-26 20:51:15,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:15,212 INFO ]: Finished difference Result 21 states and 76 transitions. [2018-06-26 20:51:15,237 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:15,237 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:51:15,237 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:15,238 INFO ]: With dead ends: 21 [2018-06-26 20:51:15,238 INFO ]: Without dead ends: 16 [2018-06-26 20:51:15,238 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 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 20:51:15,238 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 20:51:15,239 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-06-26 20:51:15,239 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 20:51:15,240 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2018-06-26 20:51:15,240 INFO ]: Start accepts. Automaton has 15 states and 45 transitions. Word has length 10 [2018-06-26 20:51:15,240 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:15,240 INFO ]: Abstraction has 15 states and 45 transitions. [2018-06-26 20:51:15,240 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:15,240 INFO ]: Start isEmpty. Operand 15 states and 45 transitions. [2018-06-26 20:51:15,240 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:51:15,240 INFO ]: Found error trace [2018-06-26 20:51:15,240 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:15,240 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:15,241 INFO ]: Analyzing trace with hash -117473198, now seen corresponding path program 1 times [2018-06-26 20:51:15,241 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:15,241 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:15,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:15,241 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:15,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:15,254 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:15,318 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:51:15,318 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:15,318 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:15,318 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:15,318 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:15,318 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:15,318 INFO ]: Start difference. First operand 15 states and 45 transitions. Second operand 3 states. [2018-06-26 20:51:15,742 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:15,742 INFO ]: Finished difference Result 16 states and 33 transitions. [2018-06-26 20:51:15,742 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:15,742 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:51:15,742 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:15,743 INFO ]: With dead ends: 16 [2018-06-26 20:51:15,743 INFO ]: Without dead ends: 15 [2018-06-26 20:51:15,743 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 20:51:15,743 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 20:51:15,744 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 20:51:15,744 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 20:51:15,744 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2018-06-26 20:51:15,744 INFO ]: Start accepts. Automaton has 15 states and 23 transitions. Word has length 10 [2018-06-26 20:51:15,745 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:15,745 INFO ]: Abstraction has 15 states and 23 transitions. [2018-06-26 20:51:15,745 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:15,745 INFO ]: Start isEmpty. Operand 15 states and 23 transitions. [2018-06-26 20:51:15,745 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:51:15,745 INFO ]: Found error trace [2018-06-26 20:51:15,745 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:15,745 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:15,745 INFO ]: Analyzing trace with hash -880109574, now seen corresponding path program 1 times [2018-06-26 20:51:15,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:15,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:15,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:15,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:15,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:15,781 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:15,888 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:51:15,888 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:15,888 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:15,888 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:15,888 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:15,888 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:15,888 INFO ]: Start difference. First operand 15 states and 23 transitions. Second operand 3 states. [2018-06-26 20:51:15,920 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:15,920 INFO ]: Finished difference Result 16 states and 21 transitions. [2018-06-26 20:51:15,920 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:15,920 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:51:15,920 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:15,920 INFO ]: With dead ends: 16 [2018-06-26 20:51:15,920 INFO ]: Without dead ends: 14 [2018-06-26 20:51:15,921 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 20:51:15,921 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 20:51:15,922 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 20:51:15,922 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 20:51:15,922 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-06-26 20:51:15,922 INFO ]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 10 [2018-06-26 20:51:15,922 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:15,922 INFO ]: Abstraction has 14 states and 19 transitions. [2018-06-26 20:51:15,922 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:15,922 INFO ]: Start isEmpty. Operand 14 states and 19 transitions. [2018-06-26 20:51:15,922 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:51:15,922 INFO ]: Found error trace [2018-06-26 20:51:15,922 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:15,923 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:15,923 INFO ]: Analyzing trace with hash -194219121, now seen corresponding path program 1 times [2018-06-26 20:51:15,923 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:15,923 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:15,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:15,923 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:15,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:15,950 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:16,110 INFO ]: Checked inductivity of 15 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:51:16,111 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:51:16,111 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:51:16,124 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:16,276 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:16,291 INFO ]: Computing forward predicates... [2018-06-26 20:51:16,310 INFO ]: Checked inductivity of 15 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:51:16,345 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:51:16,345 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 20:51:16,345 INFO ]: Interpolant automaton has 4 states [2018-06-26 20:51:16,345 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 20:51:16,345 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 20:51:16,346 INFO ]: Start difference. First operand 14 states and 19 transitions. Second operand 4 states. [2018-06-26 20:51:16,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:16,703 INFO ]: Finished difference Result 17 states and 21 transitions. [2018-06-26 20:51:16,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 20:51:16,703 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-26 20:51:16,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:16,703 INFO ]: With dead ends: 17 [2018-06-26 20:51:16,703 INFO ]: Without dead ends: 13 [2018-06-26 20:51:16,704 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 20:51:16,704 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:51:16,705 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 20:51:16,705 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:51:16,705 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-26 20:51:16,705 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2018-06-26 20:51:16,705 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:16,705 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-26 20:51:16,705 INFO ]: Interpolant automaton has 4 states. [2018-06-26 20:51:16,705 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-26 20:51:16,705 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:51:16,705 INFO ]: Found error trace [2018-06-26 20:51:16,706 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:16,706 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:16,706 INFO ]: Analyzing trace with hash -427770371, now seen corresponding path program 1 times [2018-06-26 20:51:16,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:16,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:16,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:16,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:16,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:16,734 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:16,883 INFO ]: Checked inductivity of 15 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:51:16,883 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:51:16,883 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 20:51:16,899 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:51:17,030 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:17,037 INFO ]: Computing forward predicates... [2018-06-26 20:51:17,043 INFO ]: Checked inductivity of 15 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:51:17,076 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:51:17,076 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 20:51:17,076 INFO ]: Interpolant automaton has 4 states [2018-06-26 20:51:17,076 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 20:51:17,076 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 20:51:17,077 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 4 states. [2018-06-26 20:51:17,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:17,508 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-26 20:51:17,509 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 20:51:17,509 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-26 20:51:17,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:17,509 INFO ]: With dead ends: 16 [2018-06-26 20:51:17,509 INFO ]: Without dead ends: 12 [2018-06-26 20:51:17,509 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 20:51:17,509 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 20:51:17,510 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 20:51:17,510 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 20:51:17,511 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-06-26 20:51:17,511 INFO ]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 10 [2018-06-26 20:51:17,511 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:17,511 INFO ]: Abstraction has 12 states and 15 transitions. [2018-06-26 20:51:17,511 INFO ]: Interpolant automaton has 4 states. [2018-06-26 20:51:17,511 INFO ]: Start isEmpty. Operand 12 states and 15 transitions. [2018-06-26 20:51:17,511 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:51:17,511 INFO ]: Found error trace [2018-06-26 20:51:17,511 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:17,511 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:17,511 INFO ]: Analyzing trace with hash 826833005, now seen corresponding path program 1 times [2018-06-26 20:51:17,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:17,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:17,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:17,512 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:17,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:17,538 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:17,684 INFO ]: Checked inductivity of 15 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:51:17,685 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:51:17,685 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 20:51:17,699 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:51:17,832 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:17,840 INFO ]: Computing forward predicates... [2018-06-26 20:51:17,846 INFO ]: Checked inductivity of 15 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:51:17,878 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:51:17,878 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 20:51:17,878 INFO ]: Interpolant automaton has 4 states [2018-06-26 20:51:17,879 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 20:51:17,879 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 20:51:17,879 INFO ]: Start difference. First operand 12 states and 15 transitions. Second operand 4 states. [2018-06-26 20:51:18,232 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:18,232 INFO ]: Finished difference Result 15 states and 17 transitions. [2018-06-26 20:51:18,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 20:51:18,232 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-26 20:51:18,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:18,233 INFO ]: With dead ends: 15 [2018-06-26 20:51:18,233 INFO ]: Without dead ends: 11 [2018-06-26 20:51:18,233 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 20:51:18,233 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 20:51:18,234 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 20:51:18,234 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 20:51:18,234 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-06-26 20:51:18,234 INFO ]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2018-06-26 20:51:18,234 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:18,234 INFO ]: Abstraction has 11 states and 12 transitions. [2018-06-26 20:51:18,234 INFO ]: Interpolant automaton has 4 states. [2018-06-26 20:51:18,234 INFO ]: Start isEmpty. Operand 11 states and 12 transitions. [2018-06-26 20:51:18,234 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:51:18,234 INFO ]: Found error trace [2018-06-26 20:51:18,234 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:18,234 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:18,235 INFO ]: Analyzing trace with hash -60920750, now seen corresponding path program 1 times [2018-06-26 20:51:18,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:18,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:18,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:18,235 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:18,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:18,256 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:18,415 INFO ]: Checked inductivity of 15 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:51:18,415 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:51:18,415 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:51:18,432 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:18,566 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:18,571 INFO ]: Computing forward predicates... [2018-06-26 20:51:18,742 INFO ]: Checked inductivity of 15 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:51:18,776 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:51:18,776 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 20:51:18,776 INFO ]: Interpolant automaton has 4 states [2018-06-26 20:51:18,776 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 20:51:18,776 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 20:51:18,776 INFO ]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2018-06-26 20:51:18,976 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:18,976 INFO ]: Finished difference Result 7 states and 8 transitions. [2018-06-26 20:51:18,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 20:51:18,976 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-26 20:51:18,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:18,976 INFO ]: With dead ends: 7 [2018-06-26 20:51:18,976 INFO ]: Without dead ends: 0 [2018-06-26 20:51:18,977 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 20:51:18,977 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 20:51:18,977 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 20:51:18,977 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 20:51:18,977 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 20:51:18,977 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2018-06-26 20:51:18,977 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:18,977 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 20:51:18,977 INFO ]: Interpolant automaton has 4 states. [2018-06-26 20:51:18,977 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 20:51:18,977 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 20:51:18,978 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:51:18,980 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:51:18 BasicIcfg [2018-06-26 20:51:18,980 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:51:18,980 INFO ]: Toolchain (without parser) took 33410.06 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 250.7 MB in the beginning and 430.5 MB in the end (delta: -179.8 MB). Peak memory consumption was 975.2 MB. Max. memory is 3.6 GB. [2018-06-26 20:51:18,982 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:51:18,982 INFO ]: ChcToBoogie took 133.38 ms. Allocated memory is still 309.3 MB. Free memory was 250.7 MB in the beginning and 247.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:51:18,982 INFO ]: Boogie Preprocessor took 74.08 ms. Allocated memory is still 309.3 MB. Free memory was 247.7 MB in the beginning and 246.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 20:51:18,983 INFO ]: RCFGBuilder took 398.72 ms. Allocated memory is still 309.3 MB. Free memory was 245.7 MB in the beginning and 221.4 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 3.6 GB. [2018-06-26 20:51:18,983 INFO ]: BlockEncodingV2 took 8880.16 ms. Allocated memory was 309.3 MB in the beginning and 1.1 GB in the end (delta: 787.0 MB). Free memory was 221.4 MB in the beginning and 398.5 MB in the end (delta: -177.1 MB). Peak memory consumption was 660.3 MB. Max. memory is 3.6 GB. [2018-06-26 20:51:18,990 INFO ]: TraceAbstraction took 23908.81 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 368.1 MB). Free memory was 398.5 MB in the beginning and 430.5 MB in the end (delta: -32.0 MB). Peak memory consumption was 336.1 MB. Max. memory is 3.6 GB. [2018-06-26 20:51:18,993 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 3922 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 133.38 ms. Allocated memory is still 309.3 MB. Free memory was 250.7 MB in the beginning and 247.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 74.08 ms. Allocated memory is still 309.3 MB. Free memory was 247.7 MB in the beginning and 246.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 398.72 ms. Allocated memory is still 309.3 MB. Free memory was 245.7 MB in the beginning and 221.4 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 8880.16 ms. Allocated memory was 309.3 MB in the beginning and 1.1 GB in the end (delta: 787.0 MB). Free memory was 221.4 MB in the beginning and 398.5 MB in the end (delta: -177.1 MB). Peak memory consumption was 660.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 23908.81 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 368.1 MB). Free memory was 398.5 MB in the beginning and 430.5 MB in the end (delta: -32.0 MB). Peak memory consumption was 336.1 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, 6 locations, 1 error locations. SAFE Result, 23.8s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 20.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 79 SDtfs, 3 SDslu, 71 SDs, 0 SdLazy, 698 SolverSat, 8086 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=10, 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, 17 MinimizatonAttempts, 6 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3952 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 187/203 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/simple_array_inversion-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-51-19-008.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_array_inversion-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-51-19-008.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_array_inversion-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-51-19-008.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_array_inversion-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-51-19-008.csv Received shutdown request...