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/ctigar/dillig01.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 21:20:11,001 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 21:20:11,004 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 21:20:11,019 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 21:20:11,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 21:20:11,020 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 21:20:11,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 21:20:11,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 21:20:11,029 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 21:20:11,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 21:20:11,030 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 21:20:11,032 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 21:20:11,033 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 21:20:11,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 21:20:11,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 21:20:11,038 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 21:20:11,039 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 21:20:11,041 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 21:20:11,055 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 21:20:11,056 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 21:20:11,057 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 21:20:11,058 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 21:20:11,061 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 21:20:11,061 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 21:20:11,061 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 21:20:11,062 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 21:20:11,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 21:20:11,068 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 21:20:11,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 21:20:11,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 21:20:11,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 21:20:11,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 21:20:11,071 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 21:20:11,071 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 21:20:11,075 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 21:20:11,075 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 21:20:11,076 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 21:20:11,098 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 21:20:11,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 21:20:11,099 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 21:20:11,099 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 21:20:11,100 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 21:20:11,100 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 21:20:11,101 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 21:20:11,101 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 21:20:11,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 21:20:11,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 21:20:11,101 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 21:20:11,104 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 21:20:11,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:20:11,105 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 21:20:11,105 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 21:20:11,105 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 21:20:11,105 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 21:20:11,105 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 21:20:11,105 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 21:20:11,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 21:20:11,106 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 21:20:11,107 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 21:20:11,108 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 21:20:11,157 INFO ]: Repository-Root is: /tmp [2018-06-26 21:20:11,169 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 21:20:11,172 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 21:20:11,174 INFO ]: Initializing SmtParser... [2018-06-26 21:20:11,174 INFO ]: SmtParser initialized [2018-06-26 21:20:11,175 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig01.c.smt2 [2018-06-26 21:20:11,176 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 21:20:11,268 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig01.c.smt2 unknown [2018-06-26 21:20:11,488 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/dillig01.c.smt2 [2018-06-26 21:20:11,492 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 21:20:11,499 INFO ]: Walking toolchain with 5 elements. [2018-06-26 21:20:11,499 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 21:20:11,500 INFO ]: Initializing ChcToBoogie... [2018-06-26 21:20:11,500 INFO ]: ChcToBoogie initialized [2018-06-26 21:20:11,503 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:20:11" (1/1) ... [2018-06-26 21:20:11,563 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:20:11 Unit [2018-06-26 21:20:11,564 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 21:20:11,564 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 21:20:11,564 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 21:20:11,564 INFO ]: Boogie Preprocessor initialized [2018-06-26 21:20:11,588 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:20:11" (1/1) ... [2018-06-26 21:20:11,588 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:20:11" (1/1) ... [2018-06-26 21:20:11,595 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:20:11" (1/1) ... [2018-06-26 21:20:11,595 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:20:11" (1/1) ... [2018-06-26 21:20:11,606 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:20:11" (1/1) ... [2018-06-26 21:20:11,608 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:20:11" (1/1) ... [2018-06-26 21:20:11,609 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:20:11" (1/1) ... [2018-06-26 21:20:11,610 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 21:20:11,611 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 21:20:11,611 INFO ]: Initializing RCFGBuilder... [2018-06-26 21:20:11,611 INFO ]: RCFGBuilder initialized [2018-06-26 21:20:11,618 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:20:11" (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 21:20:11,629 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 21:20:11,629 INFO ]: Found specification of procedure gotoProc [2018-06-26 21:20:11,629 INFO ]: Found implementation of procedure gotoProc [2018-06-26 21:20:11,629 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 21:20:11,629 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 21:20:11,629 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 21:20:11,867 INFO ]: Using library mode [2018-06-26 21:20:11,876 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:20:11 BoogieIcfgContainer [2018-06-26 21:20:11,876 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 21:20:11,876 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 21:20:11,876 INFO ]: Initializing BlockEncodingV2... [2018-06-26 21:20:11,879 INFO ]: BlockEncodingV2 initialized [2018-06-26 21:20:11,880 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:20:11" (1/1) ... [2018-06-26 21:20:11,894 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 21:20:11,895 INFO ]: Using Remove infeasible edges [2018-06-26 21:20:11,896 INFO ]: Using Maximize final states [2018-06-26 21:20:11,896 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 21:20:11,897 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 21:20:11,900 INFO ]: Using Remove sink states [2018-06-26 21:20:11,901 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 21:20:11,901 INFO ]: Using Use SBE [2018-06-26 21:20:11,923 WARN ]: expecting exponential blowup for input size 18 [2018-06-26 21:20:13,434 INFO ]: SBE split 1 edges [2018-06-26 21:20:13,450 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 21:20:13,452 INFO ]: 0 new accepting states [2018-06-26 21:20:13,502 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 21:20:13,504 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:20:13,512 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 21:20:13,513 INFO ]: 0 new accepting states [2018-06-26 21:20:13,513 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 21:20:13,514 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:20:13,520 INFO ]: Encoded RCFG 6 locations, 92 edges [2018-06-26 21:20:13,520 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:20:13 BasicIcfg [2018-06-26 21:20:13,520 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 21:20:13,522 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 21:20:13,522 INFO ]: Initializing TraceAbstraction... [2018-06-26 21:20:13,526 INFO ]: TraceAbstraction initialized [2018-06-26 21:20:13,526 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:20:11" (1/4) ... [2018-06-26 21:20:13,528 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eca70e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 09:20:13, skipping insertion in model container [2018-06-26 21:20:13,528 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:20:11" (2/4) ... [2018-06-26 21:20:13,528 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eca70e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 09:20:13, skipping insertion in model container [2018-06-26 21:20:13,528 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:20:11" (3/4) ... [2018-06-26 21:20:13,528 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eca70e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:20:13, skipping insertion in model container [2018-06-26 21:20:13,528 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:20:13" (4/4) ... [2018-06-26 21:20:13,530 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 21:20:13,541 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 21:20:13,551 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 21:20:13,610 INFO ]: Using default assertion order modulation [2018-06-26 21:20:13,610 INFO ]: Interprodecural is true [2018-06-26 21:20:13,610 INFO ]: Hoare is false [2018-06-26 21:20:13,610 INFO ]: Compute interpolants for FPandBP [2018-06-26 21:20:13,610 INFO ]: Backedges is TWOTRACK [2018-06-26 21:20:13,611 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 21:20:13,611 INFO ]: Difference is false [2018-06-26 21:20:13,611 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 21:20:13,611 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 21:20:13,627 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 21:20:13,641 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:20:13,641 INFO ]: Found error trace [2018-06-26 21:20:13,644 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:20:13,644 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:20:13,650 INFO ]: Analyzing trace with hash 38077986, now seen corresponding path program 1 times [2018-06-26 21:20:13,652 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:20:13,652 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:20:13,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:13,697 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:20:13,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:13,744 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:20:13,859 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:20:13,863 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:20:13,863 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:20:13,865 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:20:13,880 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:20:13,881 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:20:13,883 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 21:20:14,862 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:20:14,863 INFO ]: Finished difference Result 7 states and 138 transitions. [2018-06-26 21:20:14,863 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:20:14,864 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:20:14,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:20:14,874 INFO ]: With dead ends: 7 [2018-06-26 21:20:14,874 INFO ]: Without dead ends: 7 [2018-06-26 21:20:14,876 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 21:20:14,894 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:20:14,912 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:20:14,913 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:20:14,914 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2018-06-26 21:20:14,915 INFO ]: Start accepts. Automaton has 7 states and 138 transitions. Word has length 5 [2018-06-26 21:20:14,916 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:20:14,916 INFO ]: Abstraction has 7 states and 138 transitions. [2018-06-26 21:20:14,916 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:20:14,916 INFO ]: Start isEmpty. Operand 7 states and 138 transitions. [2018-06-26 21:20:14,916 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:20:14,916 INFO ]: Found error trace [2018-06-26 21:20:14,917 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:20:14,917 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:20:14,917 INFO ]: Analyzing trace with hash 1179609524, now seen corresponding path program 1 times [2018-06-26 21:20:14,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:20:14,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:20:14,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:14,918 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:20:14,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:14,926 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:20:14,953 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:20:14,954 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:20:14,954 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:20:14,955 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:20:14,955 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:20:14,955 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:20:14,955 INFO ]: Start difference. First operand 7 states and 138 transitions. Second operand 3 states. [2018-06-26 21:20:15,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:20:15,658 INFO ]: Finished difference Result 9 states and 190 transitions. [2018-06-26 21:20:15,659 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:20:15,659 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:20:15,659 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:20:15,660 INFO ]: With dead ends: 9 [2018-06-26 21:20:15,660 INFO ]: Without dead ends: 9 [2018-06-26 21:20:15,660 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 21:20:15,660 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:20:15,664 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 21:20:15,664 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:20:15,665 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2018-06-26 21:20:15,665 INFO ]: Start accepts. Automaton has 9 states and 190 transitions. Word has length 6 [2018-06-26 21:20:15,665 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:20:15,665 INFO ]: Abstraction has 9 states and 190 transitions. [2018-06-26 21:20:15,665 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:20:15,665 INFO ]: Start isEmpty. Operand 9 states and 190 transitions. [2018-06-26 21:20:15,666 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:20:15,666 INFO ]: Found error trace [2018-06-26 21:20:15,666 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:20:15,666 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:20:15,666 INFO ]: Analyzing trace with hash 1179639315, now seen corresponding path program 1 times [2018-06-26 21:20:15,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:20:15,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:20:15,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:15,667 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:20:15,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:15,676 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:20:15,712 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:20:15,712 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:20:15,713 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:20:15,713 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:20:15,713 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:20:15,713 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:20:15,713 INFO ]: Start difference. First operand 9 states and 190 transitions. Second operand 3 states. [2018-06-26 21:20:16,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:20:16,082 INFO ]: Finished difference Result 13 states and 255 transitions. [2018-06-26 21:20:16,082 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:20:16,082 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:20:16,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:20:16,082 INFO ]: With dead ends: 13 [2018-06-26 21:20:16,083 INFO ]: Without dead ends: 11 [2018-06-26 21:20:16,083 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 21:20:16,083 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 21:20:16,085 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 21:20:16,085 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 21:20:16,085 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2018-06-26 21:20:16,085 INFO ]: Start accepts. Automaton has 11 states and 76 transitions. Word has length 6 [2018-06-26 21:20:16,086 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:20:16,086 INFO ]: Abstraction has 11 states and 76 transitions. [2018-06-26 21:20:16,086 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:20:16,086 INFO ]: Start isEmpty. Operand 11 states and 76 transitions. [2018-06-26 21:20:16,086 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:20:16,086 INFO ]: Found error trace [2018-06-26 21:20:16,086 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:20:16,086 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:20:16,086 INFO ]: Analyzing trace with hash -279362884, now seen corresponding path program 1 times [2018-06-26 21:20:16,086 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:20:16,086 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:20:16,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:16,087 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:20:16,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:16,098 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:20:16,118 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:20:16,118 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:20:16,118 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:20:16,118 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:20:16,118 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:20:16,118 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:20:16,119 INFO ]: Start difference. First operand 11 states and 76 transitions. Second operand 3 states. [2018-06-26 21:20:16,182 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:20:16,182 INFO ]: Finished difference Result 15 states and 71 transitions. [2018-06-26 21:20:16,182 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:20:16,182 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:20:16,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:20:16,183 INFO ]: With dead ends: 15 [2018-06-26 21:20:16,183 INFO ]: Without dead ends: 15 [2018-06-26 21:20:16,183 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 21:20:16,183 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 21:20:16,185 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 21:20:16,185 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 21:20:16,186 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 71 transitions. [2018-06-26 21:20:16,186 INFO ]: Start accepts. Automaton has 15 states and 71 transitions. Word has length 8 [2018-06-26 21:20:16,186 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:20:16,186 INFO ]: Abstraction has 15 states and 71 transitions. [2018-06-26 21:20:16,186 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:20:16,186 INFO ]: Start isEmpty. Operand 15 states and 71 transitions. [2018-06-26 21:20:16,186 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:20:16,186 INFO ]: Found error trace [2018-06-26 21:20:16,187 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:20:16,187 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:20:16,187 INFO ]: Analyzing trace with hash -50329676, now seen corresponding path program 1 times [2018-06-26 21:20:16,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:20:16,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:20:16,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:16,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:20:16,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:16,203 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:20:16,233 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:20:16,233 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:20:16,233 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:20:16,234 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:20:16,234 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:20:16,234 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:20:16,234 INFO ]: Start difference. First operand 15 states and 71 transitions. Second operand 3 states. [2018-06-26 21:20:16,321 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:20:16,321 INFO ]: Finished difference Result 23 states and 119 transitions. [2018-06-26 21:20:16,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:20:16,322 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:20:16,322 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:20:16,322 INFO ]: With dead ends: 23 [2018-06-26 21:20:16,322 INFO ]: Without dead ends: 23 [2018-06-26 21:20:16,322 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 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 21:20:16,323 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 21:20:16,327 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-26 21:20:16,327 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 21:20:16,328 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2018-06-26 21:20:16,328 INFO ]: Start accepts. Automaton has 21 states and 114 transitions. Word has length 8 [2018-06-26 21:20:16,328 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:20:16,328 INFO ]: Abstraction has 21 states and 114 transitions. [2018-06-26 21:20:16,328 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:20:16,328 INFO ]: Start isEmpty. Operand 21 states and 114 transitions. [2018-06-26 21:20:16,329 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 21:20:16,329 INFO ]: Found error trace [2018-06-26 21:20:16,329 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:20:16,329 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:20:16,329 INFO ]: Analyzing trace with hash -1378558220, now seen corresponding path program 1 times [2018-06-26 21:20:16,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:20:16,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:20:16,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:16,330 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:20:16,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:16,349 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:20:16,389 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 21:20:16,389 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:20:16,389 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:20:16,390 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:20:16,390 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:20:16,390 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:20:16,390 INFO ]: Start difference. First operand 21 states and 114 transitions. Second operand 3 states. [2018-06-26 21:20:16,433 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:20:16,433 INFO ]: Finished difference Result 21 states and 93 transitions. [2018-06-26 21:20:16,433 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:20:16,433 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 21:20:16,433 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:20:16,434 INFO ]: With dead ends: 21 [2018-06-26 21:20:16,434 INFO ]: Without dead ends: 21 [2018-06-26 21:20:16,434 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 21:20:16,434 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 21:20:16,436 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 21:20:16,436 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 21:20:16,437 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 93 transitions. [2018-06-26 21:20:16,437 INFO ]: Start accepts. Automaton has 21 states and 93 transitions. Word has length 13 [2018-06-26 21:20:16,437 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:20:16,437 INFO ]: Abstraction has 21 states and 93 transitions. [2018-06-26 21:20:16,437 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:20:16,437 INFO ]: Start isEmpty. Operand 21 states and 93 transitions. [2018-06-26 21:20:16,438 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 21:20:16,438 INFO ]: Found error trace [2018-06-26 21:20:16,438 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:20:16,438 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:20:16,438 INFO ]: Analyzing trace with hash -1340072817, now seen corresponding path program 1 times [2018-06-26 21:20:16,438 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:20:16,438 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:20:16,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:16,439 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:20:16,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:16,459 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:20:16,867 INFO ]: Checked inductivity of 45 backedges. 17 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 21:20:16,868 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:20:16,868 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 21:20:16,888 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:20:16,971 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:20:16,984 INFO ]: Computing forward predicates... [2018-06-26 21:20:17,289 INFO ]: Checked inductivity of 45 backedges. 17 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 21:20:17,318 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:20:17,319 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-26 21:20:17,319 INFO ]: Interpolant automaton has 9 states [2018-06-26 21:20:17,319 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 21:20:17,319 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-26 21:20:17,319 INFO ]: Start difference. First operand 21 states and 93 transitions. Second operand 9 states. [2018-06-26 21:20:17,843 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:20:17,843 INFO ]: Finished difference Result 51 states and 239 transitions. [2018-06-26 21:20:17,846 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 21:20:17,846 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-26 21:20:17,846 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:20:17,848 INFO ]: With dead ends: 51 [2018-06-26 21:20:17,848 INFO ]: Without dead ends: 51 [2018-06-26 21:20:17,848 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-26 21:20:17,848 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-26 21:20:17,853 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 33. [2018-06-26 21:20:17,853 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 21:20:17,855 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 167 transitions. [2018-06-26 21:20:17,855 INFO ]: Start accepts. Automaton has 33 states and 167 transitions. Word has length 14 [2018-06-26 21:20:17,855 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:20:17,855 INFO ]: Abstraction has 33 states and 167 transitions. [2018-06-26 21:20:17,855 INFO ]: Interpolant automaton has 9 states. [2018-06-26 21:20:17,855 INFO ]: Start isEmpty. Operand 33 states and 167 transitions. [2018-06-26 21:20:17,856 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 21:20:17,856 INFO ]: Found error trace [2018-06-26 21:20:17,856 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:20:17,856 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:20:17,856 INFO ]: Analyzing trace with hash -1497438225, now seen corresponding path program 2 times [2018-06-26 21:20:17,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:20:17,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:20:17,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:17,865 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:20:17,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:17,892 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:20:17,936 INFO ]: Checked inductivity of 120 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 21:20:17,936 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:20:17,936 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:20:17,936 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:20:17,936 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:20:17,936 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:20:17,937 INFO ]: Start difference. First operand 33 states and 167 transitions. Second operand 3 states. [2018-06-26 21:20:18,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:20:18,123 INFO ]: Finished difference Result 33 states and 113 transitions. [2018-06-26 21:20:18,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:20:18,123 INFO ]: Start accepts. Automaton has 3 states. Word has length 20 [2018-06-26 21:20:18,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:20:18,124 INFO ]: With dead ends: 33 [2018-06-26 21:20:18,124 INFO ]: Without dead ends: 33 [2018-06-26 21:20:18,124 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 21:20:18,124 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 21:20:18,127 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 21:20:18,127 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 21:20:18,128 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 113 transitions. [2018-06-26 21:20:18,128 INFO ]: Start accepts. Automaton has 33 states and 113 transitions. Word has length 20 [2018-06-26 21:20:18,128 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:20:18,128 INFO ]: Abstraction has 33 states and 113 transitions. [2018-06-26 21:20:18,128 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:20:18,128 INFO ]: Start isEmpty. Operand 33 states and 113 transitions. [2018-06-26 21:20:18,129 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 21:20:18,129 INFO ]: Found error trace [2018-06-26 21:20:18,129 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:20:18,129 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:20:18,129 INFO ]: Analyzing trace with hash 2022195289, now seen corresponding path program 3 times [2018-06-26 21:20:18,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:20:18,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:20:18,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:18,130 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:20:18,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:18,173 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:20:18,377 INFO ]: Checked inductivity of 120 backedges. 30 proven. 82 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-26 21:20:18,378 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:20:18,378 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:20:18,386 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 21:20:18,533 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-26 21:20:18,533 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:20:18,538 INFO ]: Computing forward predicates... [2018-06-26 21:20:18,633 INFO ]: Checked inductivity of 120 backedges. 29 proven. 74 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-26 21:20:18,659 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:20:18,659 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2018-06-26 21:20:18,659 INFO ]: Interpolant automaton has 11 states [2018-06-26 21:20:18,659 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 21:20:18,659 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-26 21:20:18,660 INFO ]: Start difference. First operand 33 states and 113 transitions. Second operand 11 states. [2018-06-26 21:20:19,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:20:19,182 INFO ]: Finished difference Result 67 states and 227 transitions. [2018-06-26 21:20:19,182 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 21:20:19,182 INFO ]: Start accepts. Automaton has 11 states. Word has length 20 [2018-06-26 21:20:19,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:20:19,183 INFO ]: With dead ends: 67 [2018-06-26 21:20:19,183 INFO ]: Without dead ends: 67 [2018-06-26 21:20:19,184 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-06-26 21:20:19,184 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-26 21:20:19,189 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 37. [2018-06-26 21:20:19,189 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 21:20:19,189 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 126 transitions. [2018-06-26 21:20:19,190 INFO ]: Start accepts. Automaton has 37 states and 126 transitions. Word has length 20 [2018-06-26 21:20:19,190 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:20:19,190 INFO ]: Abstraction has 37 states and 126 transitions. [2018-06-26 21:20:19,190 INFO ]: Interpolant automaton has 11 states. [2018-06-26 21:20:19,190 INFO ]: Start isEmpty. Operand 37 states and 126 transitions. [2018-06-26 21:20:19,190 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 21:20:19,190 INFO ]: Found error trace [2018-06-26 21:20:19,190 INFO ]: trace histogram [5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:20:19,191 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:20:19,191 INFO ]: Analyzing trace with hash -330220327, now seen corresponding path program 4 times [2018-06-26 21:20:19,191 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:20:19,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:20:19,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:19,191 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:20:19,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:20:19,211 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:20:19,237 INFO ]: Checked inductivity of 153 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-06-26 21:20:19,237 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:20:19,237 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:20:19,237 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:20:19,237 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:20:19,237 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:20:19,237 INFO ]: Start difference. First operand 37 states and 126 transitions. Second operand 3 states. [2018-06-26 21:20:19,315 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:20:19,315 INFO ]: Finished difference Result 16 states and 33 transitions. [2018-06-26 21:20:19,315 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:20:19,315 INFO ]: Start accepts. Automaton has 3 states. Word has length 22 [2018-06-26 21:20:19,315 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:20:19,317 INFO ]: With dead ends: 16 [2018-06-26 21:20:19,317 INFO ]: Without dead ends: 0 [2018-06-26 21:20:19,317 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 21:20:19,317 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 21:20:19,317 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 21:20:19,317 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 21:20:19,317 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 21:20:19,317 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-06-26 21:20:19,317 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:20:19,317 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 21:20:19,317 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:20:19,317 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 21:20:19,317 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 21:20:19,320 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 21:20:19,321 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:20:19 BasicIcfg [2018-06-26 21:20:19,321 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 21:20:19,322 INFO ]: Toolchain (without parser) took 7829.29 ms. Allocated memory was 302.5 MB in the beginning and 607.1 MB in the end (delta: 304.6 MB). Free memory was 256.9 MB in the beginning and 511.2 MB in the end (delta: -254.4 MB). Peak memory consumption was 50.2 MB. Max. memory is 3.6 GB. [2018-06-26 21:20:19,324 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 302.5 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:20:19,324 INFO ]: ChcToBoogie took 64.43 ms. Allocated memory is still 302.5 MB. Free memory was 256.9 MB in the beginning and 254.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:20:19,325 INFO ]: Boogie Preprocessor took 46.14 ms. Allocated memory is still 302.5 MB. Free memory was 254.9 MB in the beginning and 252.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:20:19,325 INFO ]: RCFGBuilder took 264.87 ms. Allocated memory is still 302.5 MB. Free memory was 252.9 MB in the beginning and 244.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:20:19,327 INFO ]: BlockEncodingV2 took 1644.14 ms. Allocated memory was 302.5 MB in the beginning and 434.6 MB in the end (delta: 132.1 MB). Free memory was 244.9 MB in the beginning and 259.2 MB in the end (delta: -14.3 MB). Peak memory consumption was 218.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:20:19,328 INFO ]: TraceAbstraction took 5799.87 ms. Allocated memory was 434.6 MB in the beginning and 607.1 MB in the end (delta: 172.5 MB). Free memory was 259.2 MB in the beginning and 511.2 MB in the end (delta: -252.0 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:20:19,332 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, 92 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 302.5 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.43 ms. Allocated memory is still 302.5 MB. Free memory was 256.9 MB in the beginning and 254.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.14 ms. Allocated memory is still 302.5 MB. Free memory was 254.9 MB in the beginning and 252.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 264.87 ms. Allocated memory is still 302.5 MB. Free memory was 252.9 MB in the beginning and 244.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1644.14 ms. Allocated memory was 302.5 MB in the beginning and 434.6 MB in the end (delta: 132.1 MB). Free memory was 244.9 MB in the beginning and 259.2 MB in the end (delta: -14.3 MB). Peak memory consumption was 218.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5799.87 ms. Allocated memory was 434.6 MB in the beginning and 607.1 MB in the end (delta: 172.5 MB). Free memory was 259.2 MB in the beginning and 511.2 MB in the end (delta: -252.0 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 5.7s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 45 SDtfs, 2 SDslu, 79 SDs, 0 SdLazy, 1206 SolverSat, 682 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=9, 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, 10 MinimizatonAttempts, 50 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 5632 SizeOfPredicates, 0 NumberOfNonLiveVariables, 779 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 451/653 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/dillig01.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_21-20-19-352.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig01.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_21-20-19-352.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig01.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_21-20-19-352.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dillig01.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_21-20-19-352.csv Received shutdown request...