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/lustre/hysteresis_all.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-27 01:15:34,153 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-27 01:15:34,157 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-27 01:15:34,172 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-27 01:15:34,172 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-27 01:15:34,173 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-27 01:15:34,174 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-27 01:15:34,178 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-27 01:15:34,179 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-27 01:15:34,180 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-27 01:15:34,181 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-27 01:15:34,181 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-27 01:15:34,182 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-27 01:15:34,182 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-27 01:15:34,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-27 01:15:34,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-27 01:15:34,185 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-27 01:15:34,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-27 01:15:34,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-27 01:15:34,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-27 01:15:34,191 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-27 01:15:34,192 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-27 01:15:34,194 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-27 01:15:34,194 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-27 01:15:34,194 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-27 01:15:34,195 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-27 01:15:34,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-27 01:15:34,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-27 01:15:34,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-27 01:15:34,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-27 01:15:34,199 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-27 01:15:34,199 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-27 01:15:34,200 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-27 01:15:34,200 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-27 01:15:34,201 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-27 01:15:34,201 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-27 01:15:34,202 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-27 01:15:34,218 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-27 01:15:34,218 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-27 01:15:34,219 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-27 01:15:34,219 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-27 01:15:34,220 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-27 01:15:34,220 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-27 01:15:34,220 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-27 01:15:34,220 INFO L133 SettingsManager]: * Use SBE=true [2018-06-27 01:15:34,221 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-27 01:15:34,221 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-27 01:15:34,221 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-27 01:15:34,221 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-27 01:15:34,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 01:15:34,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-27 01:15:34,222 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-27 01:15:34,222 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-27 01:15:34,222 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-27 01:15:34,222 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-27 01:15:34,222 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-27 01:15:34,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-27 01:15:34,223 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-27 01:15:34,224 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-27 01:15:34,224 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-27 01:15:34,268 INFO ]: Repository-Root is: /tmp [2018-06-27 01:15:34,282 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-27 01:15:34,290 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-27 01:15:34,291 INFO ]: Initializing SmtParser... [2018-06-27 01:15:34,292 INFO ]: SmtParser initialized [2018-06-27 01:15:34,292 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/hysteresis_all.smt2 [2018-06-27 01:15:34,293 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-27 01:15:34,381 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/hysteresis_all.smt2 unknown [2018-06-27 01:15:34,692 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/hysteresis_all.smt2 [2018-06-27 01:15:34,696 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-27 01:15:34,703 INFO ]: Walking toolchain with 5 elements. [2018-06-27 01:15:34,704 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-27 01:15:34,704 INFO ]: Initializing ChcToBoogie... [2018-06-27 01:15:34,704 INFO ]: ChcToBoogie initialized [2018-06-27 01:15:34,707 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 01:15:34" (1/1) ... [2018-06-27 01:15:34,768 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:15:34 Unit [2018-06-27 01:15:34,768 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-27 01:15:34,769 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-27 01:15:34,769 INFO ]: Initializing Boogie Preprocessor... [2018-06-27 01:15:34,769 INFO ]: Boogie Preprocessor initialized [2018-06-27 01:15:34,790 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:15:34" (1/1) ... [2018-06-27 01:15:34,790 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:15:34" (1/1) ... [2018-06-27 01:15:34,799 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:15:34" (1/1) ... [2018-06-27 01:15:34,799 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:15:34" (1/1) ... [2018-06-27 01:15:34,803 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:15:34" (1/1) ... [2018-06-27 01:15:34,805 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:15:34" (1/1) ... [2018-06-27 01:15:34,806 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:15:34" (1/1) ... [2018-06-27 01:15:34,810 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-27 01:15:34,811 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-27 01:15:34,811 INFO ]: Initializing RCFGBuilder... [2018-06-27 01:15:34,811 INFO ]: RCFGBuilder initialized [2018-06-27 01:15:34,812 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:15:34" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 01:15:34,829 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-27 01:15:34,829 INFO ]: Found specification of procedure gotoProc [2018-06-27 01:15:34,829 INFO ]: Found implementation of procedure gotoProc [2018-06-27 01:15:34,829 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-27 01:15:34,829 INFO ]: Found specification of procedure Ultimate.START [2018-06-27 01:15:34,829 INFO ]: Found implementation of procedure Ultimate.START [2018-06-27 01:15:35,114 INFO ]: Using library mode [2018-06-27 01:15:35,115 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 01:15:35 BoogieIcfgContainer [2018-06-27 01:15:35,115 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-27 01:15:35,115 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-27 01:15:35,115 INFO ]: Initializing BlockEncodingV2... [2018-06-27 01:15:35,116 INFO ]: BlockEncodingV2 initialized [2018-06-27 01:15:35,116 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 01:15:35" (1/1) ... [2018-06-27 01:15:35,133 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-27 01:15:35,134 INFO ]: Using Remove infeasible edges [2018-06-27 01:15:35,134 INFO ]: Using Maximize final states [2018-06-27 01:15:35,135 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-27 01:15:35,136 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-27 01:15:35,137 INFO ]: Using Remove sink states [2018-06-27 01:15:35,138 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-27 01:15:35,138 INFO ]: Using Use SBE [2018-06-27 01:15:35,147 WARN ]: expecting exponential blowup for input size 13 [2018-06-27 01:15:36,126 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 01:15:36,644 WARN ]: aborting because of expected exponential blowup for input size 43 [2018-06-27 01:15:37,027 WARN ]: aborting because of expected exponential blowup for input size 43 [2018-06-27 01:15:37,033 INFO ]: SBE split 2 edges [2018-06-27 01:15:37,138 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-27 01:15:37,145 INFO ]: 0 new accepting states [2018-06-27 01:15:55,871 INFO ]: Removed 4205 edges and 2 locations by large block encoding [2018-06-27 01:15:55,875 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 01:15:55,934 INFO ]: Removed 92 edges and 0 locations because of local infeasibility [2018-06-27 01:15:55,936 INFO ]: 0 new accepting states [2018-06-27 01:15:55,939 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 01:15:55,940 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 01:15:55,952 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-27 01:15:55,954 INFO ]: 0 new accepting states [2018-06-27 01:15:55,957 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 01:15:55,958 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 01:15:55,989 INFO ]: Encoded RCFG 6 locations, 4115 edges [2018-06-27 01:15:55,990 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 01:15:55 BasicIcfg [2018-06-27 01:15:55,990 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-27 01:15:55,991 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-27 01:15:55,991 INFO ]: Initializing TraceAbstraction... [2018-06-27 01:15:55,996 INFO ]: TraceAbstraction initialized [2018-06-27 01:15:55,996 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 01:15:34" (1/4) ... [2018-06-27 01:15:55,997 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f73e125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 27.06 01:15:55, skipping insertion in model container [2018-06-27 01:15:55,997 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 01:15:34" (2/4) ... [2018-06-27 01:15:55,998 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f73e125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 01:15:55, skipping insertion in model container [2018-06-27 01:15:55,998 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 01:15:35" (3/4) ... [2018-06-27 01:15:55,998 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f73e125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 01:15:55, skipping insertion in model container [2018-06-27 01:15:55,998 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 01:15:55" (4/4) ... [2018-06-27 01:15:55,999 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-27 01:15:56,011 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-27 01:15:56,017 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-27 01:15:56,062 INFO ]: Using default assertion order modulation [2018-06-27 01:15:56,063 INFO ]: Interprodecural is true [2018-06-27 01:15:56,063 INFO ]: Hoare is false [2018-06-27 01:15:56,063 INFO ]: Compute interpolants for FPandBP [2018-06-27 01:15:56,063 INFO ]: Backedges is TWOTRACK [2018-06-27 01:15:56,063 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-27 01:15:56,063 INFO ]: Difference is false [2018-06-27 01:15:56,063 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-27 01:15:56,063 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-27 01:15:56,092 INFO ]: Start isEmpty. Operand 6 states. [2018-06-27 01:15:56,119 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 01:15:56,119 INFO ]: Found error trace [2018-06-27 01:15:56,120 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 01:15:56,120 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:15:56,125 INFO ]: Analyzing trace with hash 287203782, now seen corresponding path program 1 times [2018-06-27 01:15:56,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:15:56,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:15:56,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:56,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:15:56,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:15:56,219 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:15:56,322 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:15:56,324 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:15:56,324 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:15:56,326 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:15:56,342 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:15:56,342 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:15:56,345 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-27 01:16:01,550 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:01,550 INFO ]: Finished difference Result 7 states and 4116 transitions. [2018-06-27 01:16:01,550 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:01,552 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 01:16:01,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:01,586 INFO ]: With dead ends: 7 [2018-06-27 01:16:01,586 INFO ]: Without dead ends: 7 [2018-06-27 01:16:01,589 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-27 01:16:01,617 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:01,698 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:01,700 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:01,708 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4116 transitions. [2018-06-27 01:16:01,709 INFO ]: Start accepts. Automaton has 7 states and 4116 transitions. Word has length 5 [2018-06-27 01:16:01,710 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:01,710 INFO ]: Abstraction has 7 states and 4116 transitions. [2018-06-27 01:16:01,710 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:01,710 INFO ]: Start isEmpty. Operand 7 states and 4116 transitions. [2018-06-27 01:16:01,714 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:01,714 INFO ]: Found error trace [2018-06-27 01:16:01,714 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:01,714 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:01,714 INFO ]: Analyzing trace with hash 71578872, now seen corresponding path program 1 times [2018-06-27 01:16:01,714 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:01,714 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:01,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:01,716 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:01,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:01,787 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:01,914 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:01,914 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:01,914 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:01,916 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:01,916 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:01,916 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:01,916 INFO ]: Start difference. First operand 7 states and 4116 transitions. Second operand 3 states. [2018-06-27 01:16:07,104 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:07,105 INFO ]: Finished difference Result 8 states and 4116 transitions. [2018-06-27 01:16:07,133 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:07,133 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:07,133 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:07,138 INFO ]: With dead ends: 8 [2018-06-27 01:16:07,138 INFO ]: Without dead ends: 7 [2018-06-27 01:16:07,139 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-27 01:16:07,139 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:07,156 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:07,156 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:07,161 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3092 transitions. [2018-06-27 01:16:07,162 INFO ]: Start accepts. Automaton has 7 states and 3092 transitions. Word has length 6 [2018-06-27 01:16:07,162 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:07,162 INFO ]: Abstraction has 7 states and 3092 transitions. [2018-06-27 01:16:07,162 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:07,162 INFO ]: Start isEmpty. Operand 7 states and 3092 transitions. [2018-06-27 01:16:07,163 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:07,163 INFO ]: Found error trace [2018-06-27 01:16:07,163 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:07,164 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:07,164 INFO ]: Analyzing trace with hash 72502393, now seen corresponding path program 1 times [2018-06-27 01:16:07,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:07,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:07,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:07,164 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:07,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:07,188 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:07,271 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:07,271 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:07,271 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:07,271 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:07,271 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:07,271 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:07,272 INFO ]: Start difference. First operand 7 states and 3092 transitions. Second operand 3 states. [2018-06-27 01:16:09,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:09,855 INFO ]: Finished difference Result 8 states and 3092 transitions. [2018-06-27 01:16:09,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:09,856 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:09,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:09,859 INFO ]: With dead ends: 8 [2018-06-27 01:16:09,859 INFO ]: Without dead ends: 7 [2018-06-27 01:16:09,859 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-27 01:16:09,859 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:09,873 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:09,873 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:09,876 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2324 transitions. [2018-06-27 01:16:09,876 INFO ]: Start accepts. Automaton has 7 states and 2324 transitions. Word has length 6 [2018-06-27 01:16:09,877 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:09,877 INFO ]: Abstraction has 7 states and 2324 transitions. [2018-06-27 01:16:09,877 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:09,877 INFO ]: Start isEmpty. Operand 7 states and 2324 transitions. [2018-06-27 01:16:09,879 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:09,879 INFO ]: Found error trace [2018-06-27 01:16:09,879 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:09,879 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:09,879 INFO ]: Analyzing trace with hash 74349435, now seen corresponding path program 1 times [2018-06-27 01:16:09,879 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:09,879 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:09,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:09,880 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:09,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:09,919 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:09,958 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:09,958 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:09,958 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:09,958 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:09,958 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:09,958 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:09,959 INFO ]: Start difference. First operand 7 states and 2324 transitions. Second operand 3 states. [2018-06-27 01:16:11,801 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:11,801 INFO ]: Finished difference Result 8 states and 2324 transitions. [2018-06-27 01:16:11,802 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:11,802 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:11,802 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:11,803 INFO ]: With dead ends: 8 [2018-06-27 01:16:11,803 INFO ]: Without dead ends: 7 [2018-06-27 01:16:11,804 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-27 01:16:11,804 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:11,814 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:11,814 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:11,817 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1940 transitions. [2018-06-27 01:16:11,817 INFO ]: Start accepts. Automaton has 7 states and 1940 transitions. Word has length 6 [2018-06-27 01:16:11,817 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:11,817 INFO ]: Abstraction has 7 states and 1940 transitions. [2018-06-27 01:16:11,817 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:11,818 INFO ]: Start isEmpty. Operand 7 states and 1940 transitions. [2018-06-27 01:16:11,818 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:11,819 INFO ]: Found error trace [2018-06-27 01:16:11,819 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:11,819 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:11,819 INFO ]: Analyzing trace with hash 75272956, now seen corresponding path program 1 times [2018-06-27 01:16:11,819 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:11,819 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:11,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:11,820 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:11,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:11,848 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:11,890 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:11,890 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:11,890 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:11,890 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:11,890 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:11,890 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:11,890 INFO ]: Start difference. First operand 7 states and 1940 transitions. Second operand 3 states. [2018-06-27 01:16:13,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:13,407 INFO ]: Finished difference Result 8 states and 1940 transitions. [2018-06-27 01:16:13,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:13,407 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:13,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:13,409 INFO ]: With dead ends: 8 [2018-06-27 01:16:13,409 INFO ]: Without dead ends: 7 [2018-06-27 01:16:13,409 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-27 01:16:13,409 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:13,417 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:13,417 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:13,419 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1300 transitions. [2018-06-27 01:16:13,419 INFO ]: Start accepts. Automaton has 7 states and 1300 transitions. Word has length 6 [2018-06-27 01:16:13,419 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:13,419 INFO ]: Abstraction has 7 states and 1300 transitions. [2018-06-27 01:16:13,419 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:13,419 INFO ]: Start isEmpty. Operand 7 states and 1300 transitions. [2018-06-27 01:16:13,420 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:13,420 INFO ]: Found error trace [2018-06-27 01:16:13,420 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:13,420 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:13,420 INFO ]: Analyzing trace with hash -1817945094, now seen corresponding path program 1 times [2018-06-27 01:16:13,420 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:13,420 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:13,421 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:13,421 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:13,421 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:13,452 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:13,521 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:13,521 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:13,521 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:13,521 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:13,522 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:13,522 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:13,522 INFO ]: Start difference. First operand 7 states and 1300 transitions. Second operand 3 states. [2018-06-27 01:16:15,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:15,135 INFO ]: Finished difference Result 8 states and 1300 transitions. [2018-06-27 01:16:15,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:15,136 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:15,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:15,137 INFO ]: With dead ends: 8 [2018-06-27 01:16:15,137 INFO ]: Without dead ends: 7 [2018-06-27 01:16:15,137 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-27 01:16:15,137 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:15,140 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:15,140 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:15,141 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 788 transitions. [2018-06-27 01:16:15,141 INFO ]: Start accepts. Automaton has 7 states and 788 transitions. Word has length 6 [2018-06-27 01:16:15,141 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:15,141 INFO ]: Abstraction has 7 states and 788 transitions. [2018-06-27 01:16:15,141 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:15,141 INFO ]: Start isEmpty. Operand 7 states and 788 transitions. [2018-06-27 01:16:15,142 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:15,142 INFO ]: Found error trace [2018-06-27 01:16:15,142 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:15,142 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:15,142 INFO ]: Analyzing trace with hash -873183111, now seen corresponding path program 1 times [2018-06-27 01:16:15,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:15,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:15,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:15,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:15,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:15,161 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:15,309 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:15,309 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:15,309 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:15,309 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:15,309 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:15,309 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:15,309 INFO ]: Start difference. First operand 7 states and 788 transitions. Second operand 3 states. [2018-06-27 01:16:15,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:15,950 INFO ]: Finished difference Result 8 states and 788 transitions. [2018-06-27 01:16:15,953 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:15,953 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:15,953 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:15,954 INFO ]: With dead ends: 8 [2018-06-27 01:16:15,954 INFO ]: Without dead ends: 7 [2018-06-27 01:16:15,954 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:15,954 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:15,956 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:15,956 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:15,957 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 532 transitions. [2018-06-27 01:16:15,957 INFO ]: Start accepts. Automaton has 7 states and 532 transitions. Word has length 6 [2018-06-27 01:16:15,957 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:15,957 INFO ]: Abstraction has 7 states and 532 transitions. [2018-06-27 01:16:15,957 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:15,957 INFO ]: Start isEmpty. Operand 7 states and 532 transitions. [2018-06-27 01:16:15,957 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:15,957 INFO ]: Found error trace [2018-06-27 01:16:15,957 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:15,957 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:15,957 INFO ]: Analyzing trace with hash -871336069, now seen corresponding path program 1 times [2018-06-27 01:16:15,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:15,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:15,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:15,958 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:15,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:15,975 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:16,024 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:16,025 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:16,025 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:16,025 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:16,025 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:16,025 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:16,025 INFO ]: Start difference. First operand 7 states and 532 transitions. Second operand 3 states. [2018-06-27 01:16:16,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:16,440 INFO ]: Finished difference Result 8 states and 532 transitions. [2018-06-27 01:16:16,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:16,440 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:16,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:16,440 INFO ]: With dead ends: 8 [2018-06-27 01:16:16,440 INFO ]: Without dead ends: 7 [2018-06-27 01:16:16,441 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-27 01:16:16,441 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:16,443 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:16,443 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:16,443 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 404 transitions. [2018-06-27 01:16:16,443 INFO ]: Start accepts. Automaton has 7 states and 404 transitions. Word has length 6 [2018-06-27 01:16:16,443 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:16,443 INFO ]: Abstraction has 7 states and 404 transitions. [2018-06-27 01:16:16,443 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:16,443 INFO ]: Start isEmpty. Operand 7 states and 404 transitions. [2018-06-27 01:16:16,443 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:16,443 INFO ]: Found error trace [2018-06-27 01:16:16,444 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:16,444 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:16,444 INFO ]: Analyzing trace with hash -870412548, now seen corresponding path program 1 times [2018-06-27 01:16:16,444 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:16,444 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:16,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:16,444 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:16,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:16,463 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:16,489 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:16,489 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:16,489 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:16,489 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:16,489 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:16,489 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:16,489 INFO ]: Start difference. First operand 7 states and 404 transitions. Second operand 3 states. [2018-06-27 01:16:16,808 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:16,808 INFO ]: Finished difference Result 8 states and 404 transitions. [2018-06-27 01:16:16,808 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:16,808 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:16,808 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:16,809 INFO ]: With dead ends: 8 [2018-06-27 01:16:16,809 INFO ]: Without dead ends: 7 [2018-06-27 01:16:16,809 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-27 01:16:16,809 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:16,810 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:16,810 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:16,811 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 340 transitions. [2018-06-27 01:16:16,811 INFO ]: Start accepts. Automaton has 7 states and 340 transitions. Word has length 6 [2018-06-27 01:16:16,811 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:16,811 INFO ]: Abstraction has 7 states and 340 transitions. [2018-06-27 01:16:16,811 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:16,811 INFO ]: Start isEmpty. Operand 7 states and 340 transitions. [2018-06-27 01:16:16,811 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:16,811 INFO ]: Found error trace [2018-06-27 01:16:16,811 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:16,811 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:16,811 INFO ]: Analyzing trace with hash -869489027, now seen corresponding path program 1 times [2018-06-27 01:16:16,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:16,811 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:16,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:16,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:16,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:16,822 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:16,932 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:16,932 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:16,933 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:16,933 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:16,933 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:16,933 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:16,933 INFO ]: Start difference. First operand 7 states and 340 transitions. Second operand 3 states. [2018-06-27 01:16:17,193 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:17,193 INFO ]: Finished difference Result 8 states and 340 transitions. [2018-06-27 01:16:17,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:17,194 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:17,194 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:17,194 INFO ]: With dead ends: 8 [2018-06-27 01:16:17,194 INFO ]: Without dead ends: 7 [2018-06-27 01:16:17,195 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-27 01:16:17,195 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:17,196 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:17,196 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:17,196 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2018-06-27 01:16:17,196 INFO ]: Start accepts. Automaton has 7 states and 212 transitions. Word has length 6 [2018-06-27 01:16:17,196 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:17,196 INFO ]: Abstraction has 7 states and 212 transitions. [2018-06-27 01:16:17,196 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:17,196 INFO ]: Start isEmpty. Operand 7 states and 212 transitions. [2018-06-27 01:16:17,196 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:17,196 INFO ]: Found error trace [2018-06-27 01:16:17,197 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:17,197 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:17,197 INFO ]: Analyzing trace with hash -637685256, now seen corresponding path program 1 times [2018-06-27 01:16:17,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:17,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:17,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:17,197 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:17,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:17,208 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:17,317 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:17,317 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:17,317 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:17,317 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:17,317 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:17,317 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:17,317 INFO ]: Start difference. First operand 7 states and 212 transitions. Second operand 3 states. [2018-06-27 01:16:18,042 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:18,043 INFO ]: Finished difference Result 8 states and 212 transitions. [2018-06-27 01:16:18,043 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:18,043 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:18,043 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:18,043 INFO ]: With dead ends: 8 [2018-06-27 01:16:18,043 INFO ]: Without dead ends: 7 [2018-06-27 01:16:18,043 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-27 01:16:18,043 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:18,044 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:18,044 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:18,044 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2018-06-27 01:16:18,044 INFO ]: Start accepts. Automaton has 7 states and 164 transitions. Word has length 6 [2018-06-27 01:16:18,044 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:18,044 INFO ]: Abstraction has 7 states and 164 transitions. [2018-06-27 01:16:18,044 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:18,044 INFO ]: Start isEmpty. Operand 7 states and 164 transitions. [2018-06-27 01:16:18,044 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:18,044 INFO ]: Found error trace [2018-06-27 01:16:18,044 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:18,045 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:18,045 INFO ]: Analyzing trace with hash 1293068280, now seen corresponding path program 1 times [2018-06-27 01:16:18,045 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:18,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:18,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:18,045 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:18,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:18,055 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:18,089 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:18,089 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:18,089 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:18,089 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:18,089 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:18,089 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:18,089 INFO ]: Start difference. First operand 7 states and 164 transitions. Second operand 3 states. [2018-06-27 01:16:18,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:18,215 INFO ]: Finished difference Result 8 states and 164 transitions. [2018-06-27 01:16:18,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:18,215 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:18,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:18,215 INFO ]: With dead ends: 8 [2018-06-27 01:16:18,215 INFO ]: Without dead ends: 7 [2018-06-27 01:16:18,215 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-27 01:16:18,216 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:18,216 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:18,216 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:18,216 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2018-06-27 01:16:18,217 INFO ]: Start accepts. Automaton has 7 states and 116 transitions. Word has length 6 [2018-06-27 01:16:18,217 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:18,217 INFO ]: Abstraction has 7 states and 116 transitions. [2018-06-27 01:16:18,217 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:18,217 INFO ]: Start isEmpty. Operand 7 states and 116 transitions. [2018-06-27 01:16:18,217 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:18,217 INFO ]: Found error trace [2018-06-27 01:16:18,217 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:18,217 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:18,217 INFO ]: Analyzing trace with hash -1582447239, now seen corresponding path program 1 times [2018-06-27 01:16:18,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:18,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:18,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:18,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:18,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:18,230 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:18,320 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:18,321 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:18,321 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:18,321 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:18,321 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:18,321 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:18,321 INFO ]: Start difference. First operand 7 states and 116 transitions. Second operand 3 states. [2018-06-27 01:16:18,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:18,410 INFO ]: Finished difference Result 8 states and 116 transitions. [2018-06-27 01:16:18,433 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:18,433 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:18,433 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:18,433 INFO ]: With dead ends: 8 [2018-06-27 01:16:18,433 INFO ]: Without dead ends: 7 [2018-06-27 01:16:18,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-27 01:16:18,434 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:18,435 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:18,435 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:18,435 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2018-06-27 01:16:18,435 INFO ]: Start accepts. Automaton has 7 states and 84 transitions. Word has length 6 [2018-06-27 01:16:18,435 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:18,435 INFO ]: Abstraction has 7 states and 84 transitions. [2018-06-27 01:16:18,435 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:18,435 INFO ]: Start isEmpty. Operand 7 states and 84 transitions. [2018-06-27 01:16:18,435 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:18,435 INFO ]: Found error trace [2018-06-27 01:16:18,435 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:18,436 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:18,436 INFO ]: Analyzing trace with hash 1766834553, now seen corresponding path program 1 times [2018-06-27 01:16:18,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:18,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:18,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:18,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:18,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:18,444 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:18,606 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-27 01:16:18,607 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:18,607 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:18,607 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:18,607 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:18,607 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:18,607 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:18,607 INFO ]: Start difference. First operand 7 states and 84 transitions. Second operand 3 states. [2018-06-27 01:16:19,516 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:19,516 INFO ]: Finished difference Result 8 states and 84 transitions. [2018-06-27 01:16:19,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:19,516 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:19,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:19,517 INFO ]: With dead ends: 8 [2018-06-27 01:16:19,517 INFO ]: Without dead ends: 7 [2018-06-27 01:16:19,517 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:19,517 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:19,518 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:19,518 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:19,518 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2018-06-27 01:16:19,518 INFO ]: Start accepts. Automaton has 7 states and 60 transitions. Word has length 6 [2018-06-27 01:16:19,518 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:19,518 INFO ]: Abstraction has 7 states and 60 transitions. [2018-06-27 01:16:19,518 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:19,518 INFO ]: Start isEmpty. Operand 7 states and 60 transitions. [2018-06-27 01:16:19,518 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:19,518 INFO ]: Found error trace [2018-06-27 01:16:19,518 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:19,519 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:19,519 INFO ]: Analyzing trace with hash -931364934, now seen corresponding path program 1 times [2018-06-27 01:16:19,519 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:19,519 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:19,519 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:19,519 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:19,519 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:19,527 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:19,606 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:19,606 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:19,606 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:19,606 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:19,606 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:19,606 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:19,606 INFO ]: Start difference. First operand 7 states and 60 transitions. Second operand 3 states. [2018-06-27 01:16:19,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:19,652 INFO ]: Finished difference Result 8 states and 60 transitions. [2018-06-27 01:16:19,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:19,652 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:19,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:19,652 INFO ]: With dead ends: 8 [2018-06-27 01:16:19,652 INFO ]: Without dead ends: 7 [2018-06-27 01:16:19,653 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-27 01:16:19,653 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 01:16:19,653 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 01:16:19,653 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 01:16:19,654 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-06-27 01:16:19,654 INFO ]: Start accepts. Automaton has 7 states and 52 transitions. Word has length 6 [2018-06-27 01:16:19,654 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:19,654 INFO ]: Abstraction has 7 states and 52 transitions. [2018-06-27 01:16:19,654 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:19,654 INFO ]: Start isEmpty. Operand 7 states and 52 transitions. [2018-06-27 01:16:19,654 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:19,654 INFO ]: Found error trace [2018-06-27 01:16:19,654 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:19,654 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:19,654 INFO ]: Analyzing trace with hash 2006950013, now seen corresponding path program 1 times [2018-06-27 01:16:19,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:19,654 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:19,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:19,655 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:19,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:19,662 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:19,698 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:19,699 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:16:19,699 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-27 01:16:19,709 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:19,759 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:19,768 INFO ]: Computing forward predicates... [2018-06-27 01:16:19,831 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:19,865 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:16:19,865 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-27 01:16:19,865 INFO ]: Interpolant automaton has 4 states [2018-06-27 01:16:19,865 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-27 01:16:19,865 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-27 01:16:19,865 INFO ]: Start difference. First operand 7 states and 52 transitions. Second operand 4 states. [2018-06-27 01:16:20,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:20,261 INFO ]: Finished difference Result 10 states and 54 transitions. [2018-06-27 01:16:20,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 01:16:20,261 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-27 01:16:20,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:20,262 INFO ]: With dead ends: 10 [2018-06-27 01:16:20,262 INFO ]: Without dead ends: 9 [2018-06-27 01:16:20,262 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-27 01:16:20,262 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 01:16:20,263 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-27 01:16:20,263 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:16:20,263 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2018-06-27 01:16:20,264 INFO ]: Start accepts. Automaton has 8 states and 45 transitions. Word has length 6 [2018-06-27 01:16:20,264 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:20,264 INFO ]: Abstraction has 8 states and 45 transitions. [2018-06-27 01:16:20,264 INFO ]: Interpolant automaton has 4 states. [2018-06-27 01:16:20,264 INFO ]: Start isEmpty. Operand 8 states and 45 transitions. [2018-06-27 01:16:20,264 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:20,264 INFO ]: Found error trace [2018-06-27 01:16:20,264 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:20,264 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:20,264 INFO ]: Analyzing trace with hash -1730210599, now seen corresponding path program 1 times [2018-06-27 01:16:20,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:20,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:20,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:20,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:20,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:20,282 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:20,421 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:20,421 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:16:20,421 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-27 01:16:20,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 01:16:20,483 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:20,485 INFO ]: Computing forward predicates... [2018-06-27 01:16:20,536 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:20,568 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:16:20,568 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-27 01:16:20,568 INFO ]: Interpolant automaton has 4 states [2018-06-27 01:16:20,568 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-27 01:16:20,568 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-27 01:16:20,568 INFO ]: Start difference. First operand 8 states and 45 transitions. Second operand 4 states. [2018-06-27 01:16:21,462 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:21,462 INFO ]: Finished difference Result 12 states and 48 transitions. [2018-06-27 01:16:21,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 01:16:21,462 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-27 01:16:21,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:21,463 INFO ]: With dead ends: 12 [2018-06-27 01:16:21,463 INFO ]: Without dead ends: 11 [2018-06-27 01:16:21,463 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-27 01:16:21,463 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-27 01:16:21,464 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-27 01:16:21,464 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:16:21,464 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2018-06-27 01:16:21,464 INFO ]: Start accepts. Automaton has 8 states and 41 transitions. Word has length 6 [2018-06-27 01:16:21,464 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:21,465 INFO ]: Abstraction has 8 states and 41 transitions. [2018-06-27 01:16:21,465 INFO ]: Interpolant automaton has 4 states. [2018-06-27 01:16:21,465 INFO ]: Start isEmpty. Operand 8 states and 41 transitions. [2018-06-27 01:16:21,465 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:21,465 INFO ]: Found error trace [2018-06-27 01:16:21,465 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:21,465 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:21,465 INFO ]: Analyzing trace with hash 137148863, now seen corresponding path program 1 times [2018-06-27 01:16:21,465 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:21,465 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:21,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:21,466 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:21,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:21,473 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:21,529 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:21,529 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 01:16:21,529 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 01:16:21,529 INFO ]: Interpolant automaton has 3 states [2018-06-27 01:16:21,530 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 01:16:21,530 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 01:16:21,530 INFO ]: Start difference. First operand 8 states and 41 transitions. Second operand 3 states. [2018-06-27 01:16:21,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:21,568 INFO ]: Finished difference Result 9 states and 41 transitions. [2018-06-27 01:16:21,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 01:16:21,568 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 01:16:21,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:21,568 INFO ]: With dead ends: 9 [2018-06-27 01:16:21,568 INFO ]: Without dead ends: 8 [2018-06-27 01:16:21,568 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-27 01:16:21,568 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 01:16:21,570 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 01:16:21,570 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:16:21,570 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-06-27 01:16:21,570 INFO ]: Start accepts. Automaton has 8 states and 37 transitions. Word has length 6 [2018-06-27 01:16:21,570 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:21,570 INFO ]: Abstraction has 8 states and 37 transitions. [2018-06-27 01:16:21,570 INFO ]: Interpolant automaton has 3 states. [2018-06-27 01:16:21,570 INFO ]: Start isEmpty. Operand 8 states and 37 transitions. [2018-06-27 01:16:21,570 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 01:16:21,570 INFO ]: Found error trace [2018-06-27 01:16:21,570 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 01:16:21,570 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:21,570 INFO ]: Analyzing trace with hash -1277685309, now seen corresponding path program 1 times [2018-06-27 01:16:21,571 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:21,571 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:21,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:21,571 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:21,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:21,580 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:21,816 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:21,816 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:16:21,816 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-27 01:16:21,829 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 01:16:21,870 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:21,872 INFO ]: Computing forward predicates... [2018-06-27 01:16:22,118 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:22,148 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:16:22,149 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-27 01:16:22,149 INFO ]: Interpolant automaton has 4 states [2018-06-27 01:16:22,149 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-27 01:16:22,149 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-27 01:16:22,149 INFO ]: Start difference. First operand 8 states and 37 transitions. Second operand 4 states. [2018-06-27 01:16:22,368 WARN ]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-06-27 01:16:22,814 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:22,814 INFO ]: Finished difference Result 10 states and 37 transitions. [2018-06-27 01:16:22,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-27 01:16:22,814 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-27 01:16:22,815 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:22,815 INFO ]: With dead ends: 10 [2018-06-27 01:16:22,815 INFO ]: Without dead ends: 8 [2018-06-27 01:16:22,815 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-27 01:16:22,815 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 01:16:22,816 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 01:16:22,816 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:16:22,816 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-06-27 01:16:22,816 INFO ]: Start accepts. Automaton has 8 states and 29 transitions. Word has length 6 [2018-06-27 01:16:22,816 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:22,816 INFO ]: Abstraction has 8 states and 29 transitions. [2018-06-27 01:16:22,816 INFO ]: Interpolant automaton has 4 states. [2018-06-27 01:16:22,816 INFO ]: Start isEmpty. Operand 8 states and 29 transitions. [2018-06-27 01:16:22,816 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:16:22,816 INFO ]: Found error trace [2018-06-27 01:16:22,816 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:16:22,816 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:22,817 INFO ]: Analyzing trace with hash 347063585, now seen corresponding path program 1 times [2018-06-27 01:16:22,817 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:22,817 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:22,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:22,817 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:22,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:22,833 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:23,094 WARN ]: Spent 169.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-06-27 01:16:23,240 WARN ]: Spent 140.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-06-27 01:16:23,382 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:23,382 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:16:23,382 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-27 01:16:23,396 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 01:16:23,448 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:23,451 INFO ]: Computing forward predicates... [2018-06-27 01:16:23,691 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-27 01:16:23,710 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 01:16:24,056 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:24,075 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:16:24,075 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 01:16:24,075 INFO ]: Interpolant automaton has 8 states [2018-06-27 01:16:24,076 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 01:16:24,076 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-27 01:16:24,076 INFO ]: Start difference. First operand 8 states and 29 transitions. Second operand 8 states. [2018-06-27 01:16:24,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:24,296 INFO ]: Finished difference Result 11 states and 31 transitions. [2018-06-27 01:16:24,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-27 01:16:24,296 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 01:16:24,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:24,296 INFO ]: With dead ends: 11 [2018-06-27 01:16:24,296 INFO ]: Without dead ends: 9 [2018-06-27 01:16:24,297 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-27 01:16:24,297 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 01:16:24,297 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-27 01:16:24,297 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:16:24,298 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2018-06-27 01:16:24,298 INFO ]: Start accepts. Automaton has 8 states and 28 transitions. Word has length 7 [2018-06-27 01:16:24,298 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:24,298 INFO ]: Abstraction has 8 states and 28 transitions. [2018-06-27 01:16:24,298 INFO ]: Interpolant automaton has 8 states. [2018-06-27 01:16:24,298 INFO ]: Start isEmpty. Operand 8 states and 28 transitions. [2018-06-27 01:16:24,298 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:16:24,298 INFO ]: Found error trace [2018-06-27 01:16:24,298 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:16:24,298 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:24,298 INFO ]: Analyzing trace with hash 557576624, now seen corresponding path program 1 times [2018-06-27 01:16:24,298 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:24,298 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:24,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:24,299 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:24,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:24,315 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:24,487 WARN ]: Spent 105.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-06-27 01:16:24,510 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:24,510 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:16:24,510 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 01:16:24,516 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:24,552 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:24,554 INFO ]: Computing forward predicates... [2018-06-27 01:16:24,580 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 01:16:24,656 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:24,676 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:16:24,676 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 01:16:24,676 INFO ]: Interpolant automaton has 8 states [2018-06-27 01:16:24,676 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 01:16:24,676 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-27 01:16:24,676 INFO ]: Start difference. First operand 8 states and 28 transitions. Second operand 8 states. [2018-06-27 01:16:24,780 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:24,780 INFO ]: Finished difference Result 11 states and 30 transitions. [2018-06-27 01:16:24,780 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-27 01:16:24,780 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 01:16:24,780 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:24,780 INFO ]: With dead ends: 11 [2018-06-27 01:16:24,780 INFO ]: Without dead ends: 9 [2018-06-27 01:16:24,781 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-27 01:16:24,781 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 01:16:24,781 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-27 01:16:24,781 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:16:24,781 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-06-27 01:16:24,782 INFO ]: Start accepts. Automaton has 8 states and 27 transitions. Word has length 7 [2018-06-27 01:16:24,782 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:24,782 INFO ]: Abstraction has 8 states and 27 transitions. [2018-06-27 01:16:24,782 INFO ]: Interpolant automaton has 8 states. [2018-06-27 01:16:24,782 INFO ]: Start isEmpty. Operand 8 states and 27 transitions. [2018-06-27 01:16:24,782 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:16:24,782 INFO ]: Found error trace [2018-06-27 01:16:24,782 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:16:24,782 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:24,782 INFO ]: Analyzing trace with hash 1069928112, now seen corresponding path program 1 times [2018-06-27 01:16:24,782 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:24,782 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:24,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:24,783 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:24,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:24,793 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:24,940 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-27 01:16:24,967 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:24,967 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:16:24,967 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 01:16:24,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:25,010 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:25,012 INFO ]: Computing forward predicates... [2018-06-27 01:16:25,121 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:25,140 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:16:25,140 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 01:16:25,141 INFO ]: Interpolant automaton has 8 states [2018-06-27 01:16:25,141 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 01:16:25,141 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-27 01:16:25,141 INFO ]: Start difference. First operand 8 states and 27 transitions. Second operand 8 states. [2018-06-27 01:16:25,300 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:25,302 INFO ]: Finished difference Result 11 states and 29 transitions. [2018-06-27 01:16:25,303 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-27 01:16:25,303 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 01:16:25,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:25,303 INFO ]: With dead ends: 11 [2018-06-27 01:16:25,303 INFO ]: Without dead ends: 9 [2018-06-27 01:16:25,303 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-27 01:16:25,303 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 01:16:25,304 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-27 01:16:25,304 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:16:25,304 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-06-27 01:16:25,304 INFO ]: Start accepts. Automaton has 8 states and 26 transitions. Word has length 7 [2018-06-27 01:16:25,304 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:25,304 INFO ]: Abstraction has 8 states and 26 transitions. [2018-06-27 01:16:25,304 INFO ]: Interpolant automaton has 8 states. [2018-06-27 01:16:25,304 INFO ]: Start isEmpty. Operand 8 states and 26 transitions. [2018-06-27 01:16:25,304 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:16:25,304 INFO ]: Found error trace [2018-06-27 01:16:25,304 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:16:25,304 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:25,304 INFO ]: Analyzing trace with hash -78211158, now seen corresponding path program 1 times [2018-06-27 01:16:25,304 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:25,304 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:25,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:25,305 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:25,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:25,315 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:25,393 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:25,394 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:16:25,394 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 01:16:25,400 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:25,431 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:25,433 INFO ]: Computing forward predicates... [2018-06-27 01:16:25,716 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:25,735 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:16:25,735 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-27 01:16:25,735 INFO ]: Interpolant automaton has 7 states [2018-06-27 01:16:25,735 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-27 01:16:25,735 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-27 01:16:25,735 INFO ]: Start difference. First operand 8 states and 26 transitions. Second operand 7 states. [2018-06-27 01:16:25,829 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:25,829 INFO ]: Finished difference Result 10 states and 27 transitions. [2018-06-27 01:16:25,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 01:16:25,830 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-27 01:16:25,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:25,831 INFO ]: With dead ends: 10 [2018-06-27 01:16:25,831 INFO ]: Without dead ends: 8 [2018-06-27 01:16:25,831 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-27 01:16:25,831 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 01:16:25,831 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 01:16:25,831 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:16:25,832 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-06-27 01:16:25,832 INFO ]: Start accepts. Automaton has 8 states and 25 transitions. Word has length 7 [2018-06-27 01:16:25,832 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:25,832 INFO ]: Abstraction has 8 states and 25 transitions. [2018-06-27 01:16:25,832 INFO ]: Interpolant automaton has 7 states. [2018-06-27 01:16:25,832 INFO ]: Start isEmpty. Operand 8 states and 25 transitions. [2018-06-27 01:16:25,832 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:16:25,832 INFO ]: Found error trace [2018-06-27 01:16:25,832 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:16:25,832 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:25,832 INFO ]: Analyzing trace with hash 670309290, now seen corresponding path program 1 times [2018-06-27 01:16:25,832 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:25,832 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:25,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:25,833 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:25,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:25,843 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:25,984 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:25,984 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:16:25,984 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 01:16:25,991 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:26,036 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:26,038 INFO ]: Computing forward predicates... [2018-06-27 01:16:26,133 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:26,152 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:16:26,152 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 01:16:26,153 INFO ]: Interpolant automaton has 8 states [2018-06-27 01:16:26,153 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 01:16:26,153 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-27 01:16:26,153 INFO ]: Start difference. First operand 8 states and 25 transitions. Second operand 8 states. [2018-06-27 01:16:26,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:26,261 INFO ]: Finished difference Result 11 states and 27 transitions. [2018-06-27 01:16:26,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-27 01:16:26,261 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 01:16:26,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:26,262 INFO ]: With dead ends: 11 [2018-06-27 01:16:26,262 INFO ]: Without dead ends: 9 [2018-06-27 01:16:26,262 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-27 01:16:26,262 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 01:16:26,262 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-27 01:16:26,262 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:16:26,263 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2018-06-27 01:16:26,263 INFO ]: Start accepts. Automaton has 8 states and 24 transitions. Word has length 7 [2018-06-27 01:16:26,263 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:26,263 INFO ]: Abstraction has 8 states and 24 transitions. [2018-06-27 01:16:26,263 INFO ]: Interpolant automaton has 8 states. [2018-06-27 01:16:26,263 INFO ]: Start isEmpty. Operand 8 states and 24 transitions. [2018-06-27 01:16:26,263 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:16:26,263 INFO ]: Found error trace [2018-06-27 01:16:26,263 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:16:26,263 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:26,263 INFO ]: Analyzing trace with hash 517054553, now seen corresponding path program 1 times [2018-06-27 01:16:26,263 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:26,263 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:26,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:26,264 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:26,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:26,274 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:26,379 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:26,379 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:16:26,379 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 01:16:26,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:26,432 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:26,435 INFO ]: Computing forward predicates... [2018-06-27 01:16:26,573 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 01:16:26,581 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 01:16:26,832 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:26,852 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:16:26,852 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 01:16:26,852 INFO ]: Interpolant automaton has 8 states [2018-06-27 01:16:26,852 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 01:16:26,852 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-27 01:16:26,852 INFO ]: Start difference. First operand 8 states and 24 transitions. Second operand 8 states. [2018-06-27 01:16:26,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:26,938 INFO ]: Finished difference Result 11 states and 26 transitions. [2018-06-27 01:16:26,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-27 01:16:26,939 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 01:16:26,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:26,939 INFO ]: With dead ends: 11 [2018-06-27 01:16:26,939 INFO ]: Without dead ends: 9 [2018-06-27 01:16:26,939 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-27 01:16:26,939 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 01:16:26,940 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-27 01:16:26,940 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:16:26,940 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-06-27 01:16:26,940 INFO ]: Start accepts. Automaton has 8 states and 23 transitions. Word has length 7 [2018-06-27 01:16:26,940 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:26,940 INFO ]: Abstraction has 8 states and 23 transitions. [2018-06-27 01:16:26,940 INFO ]: Interpolant automaton has 8 states. [2018-06-27 01:16:26,940 INFO ]: Start isEmpty. Operand 8 states and 23 transitions. [2018-06-27 01:16:26,941 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:16:26,941 INFO ]: Found error trace [2018-06-27 01:16:26,941 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:16:26,941 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:26,941 INFO ]: Analyzing trace with hash 38089384, now seen corresponding path program 1 times [2018-06-27 01:16:26,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:26,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:26,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:26,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:26,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:26,951 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:27,040 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:27,040 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:16:27,040 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 01:16:27,046 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:27,075 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:27,076 INFO ]: Computing forward predicates... [2018-06-27 01:16:27,089 WARN ]: expecting exponential blowup for input size 8 [2018-06-27 01:16:27,122 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:27,141 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:16:27,141 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 01:16:27,141 INFO ]: Interpolant automaton has 8 states [2018-06-27 01:16:27,141 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 01:16:27,141 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-27 01:16:27,141 INFO ]: Start difference. First operand 8 states and 23 transitions. Second operand 8 states. [2018-06-27 01:16:27,224 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:27,224 INFO ]: Finished difference Result 10 states and 24 transitions. [2018-06-27 01:16:27,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 01:16:27,224 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 01:16:27,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:27,224 INFO ]: With dead ends: 10 [2018-06-27 01:16:27,224 INFO ]: Without dead ends: 8 [2018-06-27 01:16:27,224 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-27 01:16:27,224 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 01:16:27,225 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 01:16:27,225 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 01:16:27,225 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-06-27 01:16:27,225 INFO ]: Start accepts. Automaton has 8 states and 22 transitions. Word has length 7 [2018-06-27 01:16:27,225 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:27,225 INFO ]: Abstraction has 8 states and 22 transitions. [2018-06-27 01:16:27,225 INFO ]: Interpolant automaton has 8 states. [2018-06-27 01:16:27,225 INFO ]: Start isEmpty. Operand 8 states and 22 transitions. [2018-06-27 01:16:27,225 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 01:16:27,225 INFO ]: Found error trace [2018-06-27 01:16:27,225 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 01:16:27,225 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 01:16:27,225 INFO ]: Analyzing trace with hash 2047481768, now seen corresponding path program 1 times [2018-06-27 01:16:27,225 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 01:16:27,225 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 01:16:27,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:27,226 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:27,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 01:16:27,235 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:27,422 WARN ]: Spent 143.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2018-06-27 01:16:27,442 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:27,442 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 01:16:27,442 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 01:16:27,450 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 01:16:27,481 INFO ]: Conjunction of SSA is unsat [2018-06-27 01:16:27,483 INFO ]: Computing forward predicates... [2018-06-27 01:16:27,494 WARN ]: expecting exponential blowup for input size 7 [2018-06-27 01:16:27,581 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 01:16:27,600 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 01:16:27,600 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 01:16:27,601 INFO ]: Interpolant automaton has 8 states [2018-06-27 01:16:27,601 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 01:16:27,601 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-27 01:16:27,601 INFO ]: Start difference. First operand 8 states and 22 transitions. Second operand 8 states. [2018-06-27 01:16:27,631 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 01:16:27,631 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-27 01:16:27,632 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-27 01:16:27,632 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 01:16:27,632 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 01:16:27,632 INFO ]: With dead ends: 4 [2018-06-27 01:16:27,632 INFO ]: Without dead ends: 0 [2018-06-27 01:16:27,632 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-27 01:16:27,632 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-27 01:16:27,632 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-27 01:16:27,632 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-27 01:16:27,632 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-27 01:16:27,632 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-27 01:16:27,632 INFO ]: Finished accepts. word is rejected. [2018-06-27 01:16:27,632 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-27 01:16:27,632 INFO ]: Interpolant automaton has 8 states. [2018-06-27 01:16:27,632 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-27 01:16:27,632 INFO ]: Finished isEmpty. No accepting run. [2018-06-27 01:16:27,634 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-27 01:16:27,636 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 01:16:27 BasicIcfg [2018-06-27 01:16:27,636 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-27 01:16:27,637 INFO ]: Toolchain (without parser) took 52940.17 ms. Allocated memory was 308.8 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 260.2 MB in the beginning and 1.1 GB in the end (delta: -839.0 MB). Peak memory consumption was 592.8 MB. Max. memory is 3.6 GB. [2018-06-27 01:16:27,638 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 01:16:27,638 INFO ]: ChcToBoogie took 64.74 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-27 01:16:27,638 INFO ]: Boogie Preprocessor took 41.73 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-27 01:16:27,639 INFO ]: RCFGBuilder took 303.54 ms. Allocated memory is still 308.8 MB. Free memory was 256.2 MB in the beginning and 242.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-27 01:16:27,639 INFO ]: BlockEncodingV2 took 20874.87 ms. Allocated memory was 308.8 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 242.2 MB in the beginning and 1.1 GB in the end (delta: -871.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 3.6 GB. [2018-06-27 01:16:27,639 INFO ]: TraceAbstraction took 31644.89 ms. Allocated memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: 309.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 323.4 MB. Max. memory is 3.6 GB. [2018-06-27 01:16:27,646 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, 4115 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.74 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 41.73 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 303.54 ms. Allocated memory is still 308.8 MB. Free memory was 256.2 MB in the beginning and 242.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 20874.87 ms. Allocated memory was 308.8 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 242.2 MB in the beginning and 1.1 GB in the end (delta: -871.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 3.6 GB. * TraceAbstraction took 31644.89 ms. Allocated memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: 309.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 323.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 31.5s OverallTime, 27 OverallIterations, 2 TraceHistogramMax, 24.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19900 SDtfs, 0 SDslu, 207 SDs, 0 SdLazy, 12363 SolverSat, 8330 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=16, 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, 27 MinimizatonAttempts, 9 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 3186 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2831 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 38 InterpolantComputations, 16 PerfectInterpolantSequences, 15/69 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/hysteresis_all.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-27_01-16-27-665.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/hysteresis_all.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-27_01-16-27-665.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/hysteresis_all.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-27_01-16-27-665.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/hysteresis_all.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-27_01-16-27-665.csv Received shutdown request...