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/s3_srvr_3.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:09:05,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:09:05,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:09:05,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:09:05,219 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:09:05,220 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:09:05,221 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:09:05,224 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:09:05,226 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:09:05,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:09:05,228 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:09:05,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:09:05,229 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:09:05,230 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:09:05,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:09:05,235 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:09:05,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:09:05,250 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:09:05,252 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:09:05,253 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:09:05,254 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:09:05,256 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:09:05,256 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:09:05,256 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:09:05,257 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:09:05,258 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:09:05,259 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:09:05,260 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:09:05,261 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:09:05,261 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:09:05,262 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:09:05,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:09:05,263 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:09:05,264 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:09:05,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:09:05,265 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:09:05,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:09:05,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:09:05,278 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:09:05,279 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:09:05,280 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:09:05,280 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:09:05,280 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:09:05,280 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:09:05,280 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:09:05,281 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:09:05,283 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:09:05,283 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:09:05,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:09:05,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:09:05,284 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:09:05,284 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:09:05,284 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:09:05,284 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:09:05,285 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:09:05,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:09:05,285 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:09:05,286 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:09:05,287 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:09:05,331 INFO ]: Repository-Root is: /tmp [2018-06-25 00:09:05,343 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:09:05,348 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:09:05,349 INFO ]: Initializing SmtParser... [2018-06-25 00:09:05,349 INFO ]: SmtParser initialized [2018-06-25 00:09:05,350 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_3.cil.smt2 [2018-06-25 00:09:05,352 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-25 00:09:05,443 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_3.cil.smt2 unknown [2018-06-25 00:09:05,988 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_3.cil.smt2 [2018-06-25 00:09:05,993 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:09:06,008 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:09:06,009 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:09:06,009 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:09:06,009 INFO ]: ChcToBoogie initialized [2018-06-25 00:09:06,023 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:09:05" (1/1) ... [2018-06-25 00:09:06,141 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:06 Unit [2018-06-25 00:09:06,141 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:09:06,146 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:09:06,146 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:09:06,146 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:09:06,180 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:06" (1/1) ... [2018-06-25 00:09:06,180 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:06" (1/1) ... [2018-06-25 00:09:06,199 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:06" (1/1) ... [2018-06-25 00:09:06,199 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:06" (1/1) ... [2018-06-25 00:09:06,221 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:06" (1/1) ... [2018-06-25 00:09:06,231 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:06" (1/1) ... [2018-06-25 00:09:06,235 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:06" (1/1) ... [2018-06-25 00:09:06,246 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:09:06,247 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:09:06,247 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:09:06,247 INFO ]: RCFGBuilder initialized [2018-06-25 00:09:06,248 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:06" (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-25 00:09:06,273 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:09:06,273 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:09:06,273 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:09:06,273 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:09:06,273 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:09:06,273 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-25 00:09:06,679 INFO ]: Using library mode [2018-06-25 00:09:06,680 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:09:06 BoogieIcfgContainer [2018-06-25 00:09:06,680 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:09:06,680 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:09:06,680 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:09:06,682 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:09:06,683 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:09:06" (1/1) ... [2018-06-25 00:09:06,703 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:09:06,704 INFO ]: Using Remove infeasible edges [2018-06-25 00:09:06,705 INFO ]: Using Maximize final states [2018-06-25 00:09:06,706 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:09:06,712 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:09:06,715 INFO ]: Using Remove sink states [2018-06-25 00:09:06,716 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:09:06,716 INFO ]: Using Use SBE [2018-06-25 00:09:07,539 WARN ]: Simplifying disjunction of 7032 conjuctions. This might take some time... [2018-06-25 00:09:30,741 INFO ]: Simplified to disjunction of 7032 conjuctions. [2018-06-25 00:09:31,628 INFO ]: SBE split 1 edges [2018-06-25 00:09:31,704 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:09:31,707 INFO ]: 0 new accepting states [2018-06-25 00:09:31,770 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:09:31,772 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:09:31,892 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:09:31,893 INFO ]: 0 new accepting states [2018-06-25 00:09:31,894 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:09:31,895 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:09:32,053 INFO ]: Encoded RCFG 6 locations, 884 edges [2018-06-25 00:09:32,054 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:09:32 BasicIcfg [2018-06-25 00:09:32,054 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:09:32,055 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:09:32,055 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:09:32,058 INFO ]: TraceAbstraction initialized [2018-06-25 00:09:32,058 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:09:05" (1/4) ... [2018-06-25 00:09:32,060 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf4c458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:09:32, skipping insertion in model container [2018-06-25 00:09:32,060 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:09:06" (2/4) ... [2018-06-25 00:09:32,060 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf4c458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:09:32, skipping insertion in model container [2018-06-25 00:09:32,060 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:09:06" (3/4) ... [2018-06-25 00:09:32,060 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf4c458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:09:32, skipping insertion in model container [2018-06-25 00:09:32,060 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:09:32" (4/4) ... [2018-06-25 00:09:32,062 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:09:32,074 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:09:32,081 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:09:32,124 INFO ]: Using default assertion order modulation [2018-06-25 00:09:32,125 INFO ]: Interprodecural is true [2018-06-25 00:09:32,125 INFO ]: Hoare is false [2018-06-25 00:09:32,125 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:09:32,125 INFO ]: Backedges is TWOTRACK [2018-06-25 00:09:32,125 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:09:32,125 INFO ]: Difference is false [2018-06-25 00:09:32,125 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:09:32,125 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:09:32,137 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:09:32,156 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:09:32,156 INFO ]: Found error trace [2018-06-25 00:09:32,157 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:09:32,157 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:32,162 INFO ]: Analyzing trace with hash 62433570, now seen corresponding path program 1 times [2018-06-25 00:09:32,163 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:32,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:32,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:32,195 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:32,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:32,258 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:32,347 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:09:32,349 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:32,349 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:32,350 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:32,361 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:32,362 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:32,364 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:09:37,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:37,973 INFO ]: Finished difference Result 7 states and 981 transitions. [2018-06-25 00:09:37,973 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:37,974 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:09:37,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:37,988 INFO ]: With dead ends: 7 [2018-06-25 00:09:37,988 INFO ]: Without dead ends: 7 [2018-06-25 00:09:37,989 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-25 00:09:38,007 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:09:38,036 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:09:38,037 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:09:38,040 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 981 transitions. [2018-06-25 00:09:38,041 INFO ]: Start accepts. Automaton has 7 states and 981 transitions. Word has length 5 [2018-06-25 00:09:38,042 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:38,042 INFO ]: Abstraction has 7 states and 981 transitions. [2018-06-25 00:09:38,042 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:38,042 INFO ]: Start isEmpty. Operand 7 states and 981 transitions. [2018-06-25 00:09:38,043 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:09:38,043 INFO ]: Found error trace [2018-06-25 00:09:38,043 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:09:38,043 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:38,043 INFO ]: Analyzing trace with hash 1918293706, now seen corresponding path program 1 times [2018-06-25 00:09:38,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:38,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:38,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:38,044 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:38,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:38,079 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:38,134 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:09:38,134 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:38,134 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:38,136 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:38,136 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:38,136 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:38,136 INFO ]: Start difference. First operand 7 states and 981 transitions. Second operand 3 states. [2018-06-25 00:09:40,916 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:40,917 INFO ]: Finished difference Result 8 states and 983 transitions. [2018-06-25 00:09:40,917 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:40,917 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:09:40,917 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:40,918 INFO ]: With dead ends: 8 [2018-06-25 00:09:40,918 INFO ]: Without dead ends: 8 [2018-06-25 00:09:40,919 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-25 00:09:40,919 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:09:40,927 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 00:09:40,927 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:09:40,929 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 983 transitions. [2018-06-25 00:09:40,929 INFO ]: Start accepts. Automaton has 8 states and 983 transitions. Word has length 6 [2018-06-25 00:09:40,929 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:40,929 INFO ]: Abstraction has 8 states and 983 transitions. [2018-06-25 00:09:40,929 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:40,929 INFO ]: Start isEmpty. Operand 8 states and 983 transitions. [2018-06-25 00:09:40,930 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:09:40,930 INFO ]: Found error trace [2018-06-25 00:09:40,930 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:09:40,930 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:40,930 INFO ]: Analyzing trace with hash 1928035363, now seen corresponding path program 1 times [2018-06-25 00:09:40,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:40,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:40,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:40,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:40,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:40,958 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:40,998 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:09:40,999 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:40,999 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:40,999 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:40,999 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:40,999 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:40,999 INFO ]: Start difference. First operand 8 states and 983 transitions. Second operand 3 states. [2018-06-25 00:09:43,988 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:43,989 INFO ]: Finished difference Result 9 states and 985 transitions. [2018-06-25 00:09:43,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:43,990 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:09:43,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:43,992 INFO ]: With dead ends: 9 [2018-06-25 00:09:43,992 INFO ]: Without dead ends: 9 [2018-06-25 00:09:43,992 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-25 00:09:43,992 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:09:43,999 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:09:43,999 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:09:44,001 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 985 transitions. [2018-06-25 00:09:44,001 INFO ]: Start accepts. Automaton has 9 states and 985 transitions. Word has length 6 [2018-06-25 00:09:44,001 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:44,001 INFO ]: Abstraction has 9 states and 985 transitions. [2018-06-25 00:09:44,001 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:44,001 INFO ]: Start isEmpty. Operand 9 states and 985 transitions. [2018-06-25 00:09:44,002 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:09:44,002 INFO ]: Found error trace [2018-06-25 00:09:44,002 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:44,002 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:44,002 INFO ]: Analyzing trace with hash 1666618885, now seen corresponding path program 1 times [2018-06-25 00:09:44,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:44,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:44,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:44,003 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:44,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:44,077 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:44,160 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:09:44,160 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:44,160 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:44,160 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:44,160 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:44,160 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:44,160 INFO ]: Start difference. First operand 9 states and 985 transitions. Second operand 3 states. [2018-06-25 00:09:47,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:47,146 INFO ]: Finished difference Result 11 states and 1025 transitions. [2018-06-25 00:09:47,146 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:47,147 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:09:47,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:47,148 INFO ]: With dead ends: 11 [2018-06-25 00:09:47,148 INFO ]: Without dead ends: 11 [2018-06-25 00:09:47,148 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-25 00:09:47,148 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:09:47,153 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-25 00:09:47,153 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:09:47,155 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1023 transitions. [2018-06-25 00:09:47,155 INFO ]: Start accepts. Automaton has 10 states and 1023 transitions. Word has length 8 [2018-06-25 00:09:47,155 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:47,155 INFO ]: Abstraction has 10 states and 1023 transitions. [2018-06-25 00:09:47,155 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:47,155 INFO ]: Start isEmpty. Operand 10 states and 1023 transitions. [2018-06-25 00:09:47,156 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:09:47,156 INFO ]: Found error trace [2018-06-25 00:09:47,156 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:47,156 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:47,156 INFO ]: Analyzing trace with hash 260811884, now seen corresponding path program 1 times [2018-06-25 00:09:47,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:47,156 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:47,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:47,157 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:47,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:47,221 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:47,335 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:09:47,335 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:47,335 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:47,335 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:47,335 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:47,336 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:47,336 INFO ]: Start difference. First operand 10 states and 1023 transitions. Second operand 3 states. [2018-06-25 00:09:49,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:49,868 INFO ]: Finished difference Result 13 states and 1526 transitions. [2018-06-25 00:09:49,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:49,869 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:09:49,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:49,872 INFO ]: With dead ends: 13 [2018-06-25 00:09:49,872 INFO ]: Without dead ends: 13 [2018-06-25 00:09:49,875 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-25 00:09:49,876 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:09:49,888 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-25 00:09:49,888 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:09:49,891 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1524 transitions. [2018-06-25 00:09:49,891 INFO ]: Start accepts. Automaton has 12 states and 1524 transitions. Word has length 9 [2018-06-25 00:09:49,891 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:49,891 INFO ]: Abstraction has 12 states and 1524 transitions. [2018-06-25 00:09:49,891 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:49,891 INFO ]: Start isEmpty. Operand 12 states and 1524 transitions. [2018-06-25 00:09:49,894 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:09:49,894 INFO ]: Found error trace [2018-06-25 00:09:49,894 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:49,894 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:49,894 INFO ]: Analyzing trace with hash 500927344, now seen corresponding path program 1 times [2018-06-25 00:09:49,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:49,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:49,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:49,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:49,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:49,940 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:50,037 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:09:50,037 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:50,037 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:50,037 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:50,037 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:50,038 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:50,038 INFO ]: Start difference. First operand 12 states and 1524 transitions. Second operand 3 states. [2018-06-25 00:09:52,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:52,288 INFO ]: Finished difference Result 15 states and 1812 transitions. [2018-06-25 00:09:52,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:52,288 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:09:52,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:52,291 INFO ]: With dead ends: 15 [2018-06-25 00:09:52,291 INFO ]: Without dead ends: 14 [2018-06-25 00:09:52,291 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-25 00:09:52,291 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 00:09:52,302 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 00:09:52,303 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:09:52,304 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1810 transitions. [2018-06-25 00:09:52,304 INFO ]: Start accepts. Automaton has 14 states and 1810 transitions. Word has length 9 [2018-06-25 00:09:52,305 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:52,305 INFO ]: Abstraction has 14 states and 1810 transitions. [2018-06-25 00:09:52,305 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:52,305 INFO ]: Start isEmpty. Operand 14 states and 1810 transitions. [2018-06-25 00:09:52,306 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:09:52,306 INFO ]: Found error trace [2018-06-25 00:09:52,306 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:52,306 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:52,306 INFO ]: Analyzing trace with hash 444592563, now seen corresponding path program 1 times [2018-06-25 00:09:52,306 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:52,306 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:52,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:52,307 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:52,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:52,343 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:52,446 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:09:52,446 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:52,446 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:52,446 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:52,446 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:52,447 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:52,447 INFO ]: Start difference. First operand 14 states and 1810 transitions. Second operand 3 states. [2018-06-25 00:09:55,049 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:55,049 INFO ]: Finished difference Result 17 states and 1876 transitions. [2018-06-25 00:09:55,050 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:55,050 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:09:55,050 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:55,053 INFO ]: With dead ends: 17 [2018-06-25 00:09:55,053 INFO ]: Without dead ends: 17 [2018-06-25 00:09:55,053 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-25 00:09:55,053 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 00:09:55,071 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-25 00:09:55,072 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:09:55,073 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1810 transitions. [2018-06-25 00:09:55,073 INFO ]: Start accepts. Automaton has 14 states and 1810 transitions. Word has length 9 [2018-06-25 00:09:55,073 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:55,073 INFO ]: Abstraction has 14 states and 1810 transitions. [2018-06-25 00:09:55,073 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:55,073 INFO ]: Start isEmpty. Operand 14 states and 1810 transitions. [2018-06-25 00:09:55,074 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:09:55,074 INFO ]: Found error trace [2018-06-25 00:09:55,074 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:55,075 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:55,075 INFO ]: Analyzing trace with hash -80890886, now seen corresponding path program 1 times [2018-06-25 00:09:55,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:55,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:55,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:55,075 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:55,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:55,106 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:55,204 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:09:55,204 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:55,204 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:55,204 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:55,204 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:55,204 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:55,205 INFO ]: Start difference. First operand 14 states and 1810 transitions. Second operand 3 states. [2018-06-25 00:09:57,511 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:09:57,511 INFO ]: Finished difference Result 17 states and 1972 transitions. [2018-06-25 00:09:57,512 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:09:57,512 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:09:57,512 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:09:57,514 INFO ]: With dead ends: 17 [2018-06-25 00:09:57,514 INFO ]: Without dead ends: 17 [2018-06-25 00:09:57,514 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-25 00:09:57,514 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 00:09:57,527 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-06-25 00:09:57,527 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 00:09:57,528 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1970 transitions. [2018-06-25 00:09:57,528 INFO ]: Start accepts. Automaton has 16 states and 1970 transitions. Word has length 9 [2018-06-25 00:09:57,528 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:09:57,529 INFO ]: Abstraction has 16 states and 1970 transitions. [2018-06-25 00:09:57,529 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:09:57,529 INFO ]: Start isEmpty. Operand 16 states and 1970 transitions. [2018-06-25 00:09:57,530 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:09:57,530 INFO ]: Found error trace [2018-06-25 00:09:57,530 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:09:57,530 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:09:57,531 INFO ]: Analyzing trace with hash -1223131362, now seen corresponding path program 1 times [2018-06-25 00:09:57,531 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:09:57,531 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:09:57,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:57,531 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:09:57,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:09:57,567 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:09:57,655 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:09:57,655 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:09:57,655 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:09:57,655 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:09:57,656 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:09:57,656 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:09:57,656 INFO ]: Start difference. First operand 16 states and 1970 transitions. Second operand 3 states. [2018-06-25 00:10:00,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:00,825 INFO ]: Finished difference Result 19 states and 2022 transitions. [2018-06-25 00:10:00,825 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:00,825 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:10:00,825 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:00,828 INFO ]: With dead ends: 19 [2018-06-25 00:10:00,828 INFO ]: Without dead ends: 18 [2018-06-25 00:10:00,828 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-25 00:10:00,828 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 00:10:00,838 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 00:10:00,838 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 00:10:00,841 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2020 transitions. [2018-06-25 00:10:00,841 INFO ]: Start accepts. Automaton has 18 states and 2020 transitions. Word has length 10 [2018-06-25 00:10:00,841 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:00,841 INFO ]: Abstraction has 18 states and 2020 transitions. [2018-06-25 00:10:00,841 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:00,841 INFO ]: Start isEmpty. Operand 18 states and 2020 transitions. [2018-06-25 00:10:00,842 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:10:00,842 INFO ]: Found error trace [2018-06-25 00:10:00,842 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:00,842 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:00,843 INFO ]: Analyzing trace with hash -1458629217, now seen corresponding path program 1 times [2018-06-25 00:10:00,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:00,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:00,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:00,843 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:00,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:00,879 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:00,971 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:10:00,971 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:00,972 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:00,972 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:00,972 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:00,972 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:00,972 INFO ]: Start difference. First operand 18 states and 2020 transitions. Second operand 3 states. [2018-06-25 00:10:03,244 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:03,245 INFO ]: Finished difference Result 21 states and 2182 transitions. [2018-06-25 00:10:03,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:03,261 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:10:03,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:03,264 INFO ]: With dead ends: 21 [2018-06-25 00:10:03,264 INFO ]: Without dead ends: 21 [2018-06-25 00:10:03,264 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-25 00:10:03,264 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:10:03,271 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-06-25 00:10:03,271 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 00:10:03,277 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2020 transitions. [2018-06-25 00:10:03,277 INFO ]: Start accepts. Automaton has 18 states and 2020 transitions. Word has length 10 [2018-06-25 00:10:03,277 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:03,277 INFO ]: Abstraction has 18 states and 2020 transitions. [2018-06-25 00:10:03,277 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:03,277 INFO ]: Start isEmpty. Operand 18 states and 2020 transitions. [2018-06-25 00:10:03,278 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:10:03,278 INFO ]: Found error trace [2018-06-25 00:10:03,278 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:03,278 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:03,278 INFO ]: Analyzing trace with hash -1694127072, now seen corresponding path program 1 times [2018-06-25 00:10:03,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:03,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:03,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:03,282 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:03,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:03,314 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:03,419 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:10:03,419 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:03,420 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:03,420 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:03,420 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:03,420 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:03,420 INFO ]: Start difference. First operand 18 states and 2020 transitions. Second operand 3 states. [2018-06-25 00:10:05,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:05,772 INFO ]: Finished difference Result 21 states and 2278 transitions. [2018-06-25 00:10:05,773 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:05,773 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:10:05,773 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:05,776 INFO ]: With dead ends: 21 [2018-06-25 00:10:05,776 INFO ]: Without dead ends: 21 [2018-06-25 00:10:05,777 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-25 00:10:05,777 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:10:05,784 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-06-25 00:10:05,784 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 00:10:05,788 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2276 transitions. [2018-06-25 00:10:05,788 INFO ]: Start accepts. Automaton has 20 states and 2276 transitions. Word has length 10 [2018-06-25 00:10:05,788 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:05,788 INFO ]: Abstraction has 20 states and 2276 transitions. [2018-06-25 00:10:05,788 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:05,788 INFO ]: Start isEmpty. Operand 20 states and 2276 transitions. [2018-06-25 00:10:05,790 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:10:05,790 INFO ]: Found error trace [2018-06-25 00:10:05,792 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:05,792 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:05,792 INFO ]: Analyzing trace with hash -1455858654, now seen corresponding path program 1 times [2018-06-25 00:10:05,792 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:05,793 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:05,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:05,793 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:05,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:05,826 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:05,924 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:10:05,924 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:05,924 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:05,925 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:05,925 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:05,925 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:05,925 INFO ]: Start difference. First operand 20 states and 2276 transitions. Second operand 3 states. [2018-06-25 00:10:08,102 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:08,102 INFO ]: Finished difference Result 23 states and 2678 transitions. [2018-06-25 00:10:08,103 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:08,103 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:10:08,103 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:08,105 INFO ]: With dead ends: 23 [2018-06-25 00:10:08,105 INFO ]: Without dead ends: 23 [2018-06-25 00:10:08,105 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-25 00:10:08,105 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 00:10:08,111 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-06-25 00:10:08,111 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 00:10:08,113 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2676 transitions. [2018-06-25 00:10:08,113 INFO ]: Start accepts. Automaton has 22 states and 2676 transitions. Word has length 10 [2018-06-25 00:10:08,113 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:08,113 INFO ]: Abstraction has 22 states and 2676 transitions. [2018-06-25 00:10:08,113 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:08,113 INFO ]: Start isEmpty. Operand 22 states and 2676 transitions. [2018-06-25 00:10:08,114 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:10:08,114 INFO ]: Found error trace [2018-06-25 00:10:08,114 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:08,115 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:08,115 INFO ]: Analyzing trace with hash -1146479119, now seen corresponding path program 1 times [2018-06-25 00:10:08,115 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:08,115 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:08,115 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:08,115 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:08,115 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:08,140 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:08,247 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 00:10:08,247 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:08,261 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:08,261 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:08,261 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:08,261 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:08,262 INFO ]: Start difference. First operand 22 states and 2676 transitions. Second operand 3 states. [2018-06-25 00:10:10,429 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:10,429 INFO ]: Finished difference Result 23 states and 2558 transitions. [2018-06-25 00:10:10,429 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:10,429 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:10:10,429 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:10,432 INFO ]: With dead ends: 23 [2018-06-25 00:10:10,432 INFO ]: Without dead ends: 23 [2018-06-25 00:10:10,432 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-25 00:10:10,432 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 00:10:10,438 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-06-25 00:10:10,438 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 00:10:10,440 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2556 transitions. [2018-06-25 00:10:10,440 INFO ]: Start accepts. Automaton has 22 states and 2556 transitions. Word has length 10 [2018-06-25 00:10:10,440 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:10,440 INFO ]: Abstraction has 22 states and 2556 transitions. [2018-06-25 00:10:10,440 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:10,440 INFO ]: Start isEmpty. Operand 22 states and 2556 transitions. [2018-06-25 00:10:10,440 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:10:10,440 INFO ]: Found error trace [2018-06-25 00:10:10,440 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:10,441 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:10,441 INFO ]: Analyzing trace with hash -1381053453, now seen corresponding path program 1 times [2018-06-25 00:10:10,441 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:10,441 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:10,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:10,441 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:10,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:10,464 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:10,538 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:10:10,538 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:10,538 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:10,538 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:10,538 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:10,538 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:10,538 INFO ]: Start difference. First operand 22 states and 2556 transitions. Second operand 3 states. [2018-06-25 00:10:12,794 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:12,794 INFO ]: Finished difference Result 25 states and 3110 transitions. [2018-06-25 00:10:12,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:12,795 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:10:12,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:12,796 INFO ]: With dead ends: 25 [2018-06-25 00:10:12,796 INFO ]: Without dead ends: 25 [2018-06-25 00:10:12,797 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-25 00:10:12,797 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 00:10:12,803 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-06-25 00:10:12,803 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 00:10:12,804 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3108 transitions. [2018-06-25 00:10:12,804 INFO ]: Start accepts. Automaton has 24 states and 3108 transitions. Word has length 10 [2018-06-25 00:10:12,805 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:12,805 INFO ]: Abstraction has 24 states and 3108 transitions. [2018-06-25 00:10:12,805 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:12,805 INFO ]: Start isEmpty. Operand 24 states and 3108 transitions. [2018-06-25 00:10:12,805 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:10:12,805 INFO ]: Found error trace [2018-06-25 00:10:12,805 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:12,805 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:12,806 INFO ]: Analyzing trace with hash 352596245, now seen corresponding path program 1 times [2018-06-25 00:10:12,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:12,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:12,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:12,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:12,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:12,830 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:12,910 INFO ]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 00:10:12,910 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:12,910 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:12,910 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:12,910 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:12,910 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:12,910 INFO ]: Start difference. First operand 24 states and 3108 transitions. Second operand 3 states. [2018-06-25 00:10:15,092 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:10:15,092 INFO ]: Finished difference Result 41 states and 5648 transitions. [2018-06-25 00:10:15,092 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:15,092 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 00:10:15,092 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:10:15,096 INFO ]: With dead ends: 41 [2018-06-25 00:10:15,096 INFO ]: Without dead ends: 41 [2018-06-25 00:10:15,096 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-25 00:10:15,096 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-25 00:10:15,106 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-06-25 00:10:15,106 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-25 00:10:15,110 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 5646 transitions. [2018-06-25 00:10:15,110 INFO ]: Start accepts. Automaton has 40 states and 5646 transitions. Word has length 11 [2018-06-25 00:10:15,110 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:10:15,110 INFO ]: Abstraction has 40 states and 5646 transitions. [2018-06-25 00:10:15,110 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:10:15,110 INFO ]: Start isEmpty. Operand 40 states and 5646 transitions. [2018-06-25 00:10:15,112 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:10:15,112 INFO ]: Found error trace [2018-06-25 00:10:15,112 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:10:15,112 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:10:15,112 INFO ]: Analyzing trace with hash 416319194, now seen corresponding path program 1 times [2018-06-25 00:10:15,112 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:10:15,112 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:10:15,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:15,114 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:10:15,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:10:15,139 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:10:15,225 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 00:10:15,225 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:10:15,226 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:10:15,226 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:10:15,226 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:10:15,226 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:10:15,226 INFO ]: Start difference. First operand 40 states and 5646 transitions. Second operand 3 states. Received shutdown request... [2018-06-25 00:10:17,144 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:10:17,144 WARN ]: Verification canceled [2018-06-25 00:10:17,147 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:10:17,148 WARN ]: Timeout [2018-06-25 00:10:17,148 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:10:17 BasicIcfg [2018-06-25 00:10:17,148 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:10:17,149 INFO ]: Toolchain (without parser) took 71155.03 ms. Allocated memory was 306.2 MB in the beginning and 1.1 GB in the end (delta: 837.3 MB). Free memory was 238.6 MB in the beginning and 518.2 MB in the end (delta: -279.6 MB). Peak memory consumption was 557.7 MB. Max. memory is 3.6 GB. [2018-06-25 00:10:17,150 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 306.2 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:10:17,150 INFO ]: ChcToBoogie took 136.60 ms. Allocated memory is still 306.2 MB. Free memory was 236.6 MB in the beginning and 234.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:10:17,151 INFO ]: Boogie Preprocessor took 100.88 ms. Allocated memory is still 306.2 MB. Free memory was 234.6 MB in the beginning and 232.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:10:17,152 INFO ]: RCFGBuilder took 432.75 ms. Allocated memory is still 306.2 MB. Free memory was 232.7 MB in the beginning and 200.7 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:10:17,152 INFO ]: BlockEncodingV2 took 25373.44 ms. Allocated memory was 306.2 MB in the beginning and 399.0 MB in the end (delta: 92.8 MB). Free memory was 200.7 MB in the beginning and 348.6 MB in the end (delta: -147.9 MB). Peak memory consumption was 129.2 MB. Max. memory is 3.6 GB. [2018-06-25 00:10:17,152 INFO ]: TraceAbstraction took 45093.24 ms. Allocated memory was 399.0 MB in the beginning and 1.1 GB in the end (delta: 744.5 MB). Free memory was 348.6 MB in the beginning and 518.2 MB in the end (delta: -169.6 MB). Peak memory consumption was 574.9 MB. Max. memory is 3.6 GB. [2018-06-25 00:10:17,157 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, 884 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 306.2 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 136.60 ms. Allocated memory is still 306.2 MB. Free memory was 236.6 MB in the beginning and 234.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 100.88 ms. Allocated memory is still 306.2 MB. Free memory was 234.6 MB in the beginning and 232.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 432.75 ms. Allocated memory is still 306.2 MB. Free memory was 232.7 MB in the beginning and 200.7 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 25373.44 ms. Allocated memory was 306.2 MB in the beginning and 399.0 MB in the end (delta: 92.8 MB). Free memory was 200.7 MB in the beginning and 348.6 MB in the end (delta: -147.9 MB). Peak memory consumption was 129.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 45093.24 ms. Allocated memory was 399.0 MB in the beginning and 1.1 GB in the end (delta: 744.5 MB). Free memory was 348.6 MB in the beginning and 518.2 MB in the end (delta: -169.6 MB). Peak memory consumption was 574.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (40states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 45.0s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 42.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 77 SDtfs, 0 SDslu, 58 SDs, 0 SdLazy, 13317 SolverSat, 10172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=15, 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 14 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 1380 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 180/180 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-10-17-177.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-10-17-177.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-10-17-177.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-10-17-177.csv Completed graceful shutdown