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/hopv/lia/termination/Ackermann04.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:24:38,133 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:24:38,135 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:24:38,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:24:38,150 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:24:38,153 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:24:38,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:24:38,156 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:24:38,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:24:38,159 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:24:38,160 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:24:38,160 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:24:38,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:24:38,162 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:24:38,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:24:38,166 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:24:38,168 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:24:38,169 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:24:38,171 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:24:38,172 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:24:38,173 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:24:38,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:24:38,175 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:24:38,175 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:24:38,176 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:24:38,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:24:38,178 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:24:38,178 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:24:38,179 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:24:38,179 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:24:38,180 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:24:38,180 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:24:38,181 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:24:38,181 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:24:38,182 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:24:38,182 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:24:38,195 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:24:38,195 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:24:38,195 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:24:38,196 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:24:38,196 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:24:38,197 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:24:38,197 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:24:38,197 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:24:38,197 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:24:38,197 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:24:38,198 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:24:38,198 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:24:38,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:24:38,198 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:24:38,198 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:24:38,198 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:24:38,199 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:24:38,199 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:24:38,199 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:24:38,199 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:24:38,199 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:24:38,205 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:24:38,205 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:24:38,249 INFO ]: Repository-Root is: /tmp [2018-06-24 21:24:38,264 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:24:38,269 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:24:38,270 INFO ]: Initializing SmtParser... [2018-06-24 21:24:38,270 INFO ]: SmtParser initialized [2018-06-24 21:24:38,271 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/termination/Ackermann04.smt2 [2018-06-24 21:24:38,272 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-24 21:24:38,350 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/termination/Ackermann04.smt2 unknown [2018-06-24 21:24:38,953 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/termination/Ackermann04.smt2 [2018-06-24 21:24:38,958 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:24:38,965 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:24:38,966 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:24:38,966 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:24:38,966 INFO ]: ChcToBoogie initialized [2018-06-24 21:24:38,969 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:24:38" (1/1) ... [2018-06-24 21:24:39,063 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:39 Unit [2018-06-24 21:24:39,063 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:24:39,064 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:24:39,064 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:24:39,064 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:24:39,086 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:39" (1/1) ... [2018-06-24 21:24:39,086 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:39" (1/1) ... [2018-06-24 21:24:39,107 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:39" (1/1) ... [2018-06-24 21:24:39,107 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:39" (1/1) ... [2018-06-24 21:24:39,126 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:39" (1/1) ... [2018-06-24 21:24:39,138 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:39" (1/1) ... [2018-06-24 21:24:39,142 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:39" (1/1) ... [2018-06-24 21:24:39,152 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:24:39,152 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:24:39,152 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:24:39,152 INFO ]: RCFGBuilder initialized [2018-06-24 21:24:39,153 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:39" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:24:39,189 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:24:39,189 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:24:39,189 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:24:39,189 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:24:39,189 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:24:39,189 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:24:40,310 INFO ]: Using library mode [2018-06-24 21:24:40,310 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:24:40 BoogieIcfgContainer [2018-06-24 21:24:40,310 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:24:40,311 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:24:40,311 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:24:40,312 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:24:40,312 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:24:40" (1/1) ... [2018-06-24 21:24:40,355 INFO ]: Initial Icfg 49 locations, 79 edges [2018-06-24 21:24:40,356 INFO ]: Using Remove infeasible edges [2018-06-24 21:24:40,357 INFO ]: Using Maximize final states [2018-06-24 21:24:40,358 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:24:40,358 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:24:40,359 INFO ]: Using Remove sink states [2018-06-24 21:24:40,360 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:24:40,360 INFO ]: Using Use SBE [2018-06-24 21:24:40,369 WARN ]: expecting exponential blowup for input size 9 [2018-06-24 21:24:42,946 WARN ]: expecting exponential blowup for input size 9 [2018-06-24 21:24:45,746 WARN ]: expecting exponential blowup for input size 9 [2018-06-24 21:24:47,069 WARN ]: expecting exponential blowup for input size 9 [2018-06-24 21:24:48,093 WARN ]: expecting exponential blowup for input size 9 [2018-06-24 21:24:50,340 INFO ]: SBE split 5 edges [2018-06-24 21:24:50,347 INFO ]: Removed 4 edges and 2 locations because of local infeasibility [2018-06-24 21:24:50,349 INFO ]: 0 new accepting states [2018-06-24 21:24:52,389 INFO ]: Removed 213 edges and 13 locations by large block encoding [2018-06-24 21:24:52,391 INFO ]: Removed 4 edges and 3 locations by removing sink states [2018-06-24 21:24:52,392 INFO ]: Removed 38 edges and 0 locations because of local infeasibility [2018-06-24 21:24:52,392 INFO ]: 0 new accepting states [2018-06-24 21:24:52,393 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:24:52,393 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:24:52,393 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:24:52,394 INFO ]: 0 new accepting states [2018-06-24 21:24:52,394 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:24:52,395 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:24:52,395 INFO ]: Encoded RCFG 31 locations, 118 edges [2018-06-24 21:24:52,395 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:24:52 BasicIcfg [2018-06-24 21:24:52,395 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:24:52,397 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:24:52,397 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:24:52,402 INFO ]: TraceAbstraction initialized [2018-06-24 21:24:52,402 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:24:38" (1/4) ... [2018-06-24 21:24:52,403 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66965927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:24:52, skipping insertion in model container [2018-06-24 21:24:52,403 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:39" (2/4) ... [2018-06-24 21:24:52,403 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66965927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:24:52, skipping insertion in model container [2018-06-24 21:24:52,403 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:24:40" (3/4) ... [2018-06-24 21:24:52,403 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66965927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:24:52, skipping insertion in model container [2018-06-24 21:24:52,403 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:24:52" (4/4) ... [2018-06-24 21:24:52,405 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:24:52,414 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:24:52,422 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:24:52,465 INFO ]: Using default assertion order modulation [2018-06-24 21:24:52,465 INFO ]: Interprodecural is true [2018-06-24 21:24:52,465 INFO ]: Hoare is false [2018-06-24 21:24:52,465 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:24:52,465 INFO ]: Backedges is TWOTRACK [2018-06-24 21:24:52,465 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:24:52,465 INFO ]: Difference is false [2018-06-24 21:24:52,465 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:24:52,465 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:24:52,483 INFO ]: Start isEmpty. Operand 31 states. [2018-06-24 21:24:52,504 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:24:52,504 INFO ]: Found error trace [2018-06-24 21:24:52,505 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:24:52,505 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:52,509 INFO ]: Analyzing trace with hash 79225306, now seen corresponding path program 1 times [2018-06-24 21:24:52,510 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:52,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:52,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:52,542 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:52,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:52,610 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:52,776 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:24:52,779 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:24:52,779 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:24:52,781 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:24:52,796 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:24:52,796 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:24:52,802 INFO ]: Start difference. First operand 31 states. Second operand 3 states. [2018-06-24 21:24:53,433 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:53,434 INFO ]: Finished difference Result 44 states and 154 transitions. [2018-06-24 21:24:53,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:24:53,435 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:24:53,435 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:53,445 INFO ]: With dead ends: 44 [2018-06-24 21:24:53,446 INFO ]: Without dead ends: 35 [2018-06-24 21:24:53,447 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-24 21:24:53,465 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:24:53,489 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-06-24 21:24:53,490 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 21:24:53,491 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 56 transitions. [2018-06-24 21:24:53,492 INFO ]: Start accepts. Automaton has 26 states and 56 transitions. Word has length 5 [2018-06-24 21:24:53,493 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:53,493 INFO ]: Abstraction has 26 states and 56 transitions. [2018-06-24 21:24:53,493 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:24:53,493 INFO ]: Start isEmpty. Operand 26 states and 56 transitions. [2018-06-24 21:24:53,495 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:24:53,495 INFO ]: Found error trace [2018-06-24 21:24:53,496 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:24:53,496 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:53,496 INFO ]: Analyzing trace with hash 79344470, now seen corresponding path program 1 times [2018-06-24 21:24:53,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:53,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:53,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:53,497 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:53,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:53,515 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:53,545 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:24:53,545 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:24:53,545 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:24:53,547 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:24:53,547 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:24:53,547 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:24:53,547 INFO ]: Start difference. First operand 26 states and 56 transitions. Second operand 3 states. [2018-06-24 21:24:53,678 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:53,678 INFO ]: Finished difference Result 37 states and 93 transitions. [2018-06-24 21:24:53,678 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:24:53,678 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:24:53,678 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:53,683 INFO ]: With dead ends: 37 [2018-06-24 21:24:53,683 INFO ]: Without dead ends: 37 [2018-06-24 21:24:53,683 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-24 21:24:53,683 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 21:24:53,694 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-24 21:24:53,694 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 21:24:53,696 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 93 transitions. [2018-06-24 21:24:53,696 INFO ]: Start accepts. Automaton has 37 states and 93 transitions. Word has length 5 [2018-06-24 21:24:53,696 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:53,696 INFO ]: Abstraction has 37 states and 93 transitions. [2018-06-24 21:24:53,696 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:24:53,696 INFO ]: Start isEmpty. Operand 37 states and 93 transitions. [2018-06-24 21:24:53,699 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:24:53,699 INFO ]: Found error trace [2018-06-24 21:24:53,699 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:24:53,699 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:53,699 INFO ]: Analyzing trace with hash 79433843, now seen corresponding path program 1 times [2018-06-24 21:24:53,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:53,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:53,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:53,700 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:53,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:53,725 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:53,787 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:24:53,787 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:24:53,787 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:24:53,787 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:24:53,787 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:24:53,787 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:24:53,788 INFO ]: Start difference. First operand 37 states and 93 transitions. Second operand 3 states. [2018-06-24 21:24:53,878 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:53,878 INFO ]: Finished difference Result 58 states and 147 transitions. [2018-06-24 21:24:53,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:24:53,879 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:24:53,879 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:53,883 INFO ]: With dead ends: 58 [2018-06-24 21:24:53,883 INFO ]: Without dead ends: 58 [2018-06-24 21:24:53,883 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-24 21:24:53,884 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 21:24:53,909 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 39. [2018-06-24 21:24:53,909 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 21:24:53,911 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 97 transitions. [2018-06-24 21:24:53,911 INFO ]: Start accepts. Automaton has 39 states and 97 transitions. Word has length 5 [2018-06-24 21:24:53,911 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:53,911 INFO ]: Abstraction has 39 states and 97 transitions. [2018-06-24 21:24:53,911 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:24:53,911 INFO ]: Start isEmpty. Operand 39 states and 97 transitions. [2018-06-24 21:24:53,914 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:24:53,914 INFO ]: Found error trace [2018-06-24 21:24:53,914 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:24:53,914 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:53,914 INFO ]: Analyzing trace with hash 79553007, now seen corresponding path program 1 times [2018-06-24 21:24:53,914 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:53,914 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:53,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:53,915 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:53,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:53,930 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:53,957 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:24:53,957 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:24:53,957 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:24:53,957 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:24:53,958 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:24:53,958 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:24:53,958 INFO ]: Start difference. First operand 39 states and 97 transitions. Second operand 3 states. [2018-06-24 21:24:54,078 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:54,078 INFO ]: Finished difference Result 52 states and 117 transitions. [2018-06-24 21:24:54,078 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:24:54,078 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:24:54,078 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:54,081 INFO ]: With dead ends: 52 [2018-06-24 21:24:54,081 INFO ]: Without dead ends: 40 [2018-06-24 21:24:54,081 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-24 21:24:54,081 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 21:24:54,092 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-24 21:24:54,092 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 21:24:54,092 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 90 transitions. [2018-06-24 21:24:54,092 INFO ]: Start accepts. Automaton has 40 states and 90 transitions. Word has length 5 [2018-06-24 21:24:54,093 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:54,093 INFO ]: Abstraction has 40 states and 90 transitions. [2018-06-24 21:24:54,093 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:24:54,093 INFO ]: Start isEmpty. Operand 40 states and 90 transitions. [2018-06-24 21:24:54,095 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:24:54,095 INFO ]: Found error trace [2018-06-24 21:24:54,095 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:54,096 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:54,096 INFO ]: Analyzing trace with hash 1329507331, now seen corresponding path program 1 times [2018-06-24 21:24:54,096 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:54,096 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:54,098 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:54,098 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:54,098 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:54,142 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:54,227 INFO ]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:24:54,227 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:24:54,227 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:24:54,227 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:24:54,227 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:24:54,227 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:24:54,227 INFO ]: Start difference. First operand 40 states and 90 transitions. Second operand 3 states. [2018-06-24 21:24:54,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:54,510 INFO ]: Finished difference Result 53 states and 115 transitions. [2018-06-24 21:24:54,510 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:24:54,510 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 21:24:54,510 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:54,512 INFO ]: With dead ends: 53 [2018-06-24 21:24:54,512 INFO ]: Without dead ends: 53 [2018-06-24 21:24:54,512 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-24 21:24:54,512 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 21:24:54,519 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-06-24 21:24:54,519 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-24 21:24:54,520 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 115 transitions. [2018-06-24 21:24:54,520 INFO ]: Start accepts. Automaton has 53 states and 115 transitions. Word has length 11 [2018-06-24 21:24:54,520 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:54,520 INFO ]: Abstraction has 53 states and 115 transitions. [2018-06-24 21:24:54,520 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:24:54,520 INFO ]: Start isEmpty. Operand 53 states and 115 transitions. [2018-06-24 21:24:54,523 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:24:54,523 INFO ]: Found error trace [2018-06-24 21:24:54,523 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:54,524 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:54,524 INFO ]: Analyzing trace with hash 1275097466, now seen corresponding path program 1 times [2018-06-24 21:24:54,524 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:54,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:54,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:54,524 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:54,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:54,585 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:54,900 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:24:54,900 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:24:54,900 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-24 21:24:54,907 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:55,002 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:55,009 INFO ]: Computing forward predicates... [2018-06-24 21:24:55,286 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:24:55,311 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:24:55,311 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-06-24 21:24:55,311 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:24:55,311 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:24:55,311 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:24:55,311 INFO ]: Start difference. First operand 53 states and 115 transitions. Second operand 8 states. [2018-06-24 21:24:57,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:57,655 INFO ]: Finished difference Result 308 states and 963 transitions. [2018-06-24 21:24:57,657 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 21:24:57,657 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-24 21:24:57,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:57,669 INFO ]: With dead ends: 308 [2018-06-24 21:24:57,669 INFO ]: Without dead ends: 220 [2018-06-24 21:24:57,669 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:24:57,670 INFO ]: Start minimizeSevpa. Operand 220 states. [2018-06-24 21:24:57,721 INFO ]: Finished minimizeSevpa. Reduced states from 220 to 101. [2018-06-24 21:24:57,721 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-24 21:24:57,723 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 240 transitions. [2018-06-24 21:24:57,723 INFO ]: Start accepts. Automaton has 101 states and 240 transitions. Word has length 12 [2018-06-24 21:24:57,723 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:57,723 INFO ]: Abstraction has 101 states and 240 transitions. [2018-06-24 21:24:57,723 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:24:57,724 INFO ]: Start isEmpty. Operand 101 states and 240 transitions. [2018-06-24 21:24:57,730 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:24:57,730 INFO ]: Found error trace [2018-06-24 21:24:57,730 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:57,730 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:57,730 INFO ]: Analyzing trace with hash 1293531492, now seen corresponding path program 1 times [2018-06-24 21:24:57,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:57,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:57,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:57,731 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:57,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:57,757 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:57,812 INFO ]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:24:57,812 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:24:57,812 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:24:57,812 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:24:57,812 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:24:57,812 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:24:57,812 INFO ]: Start difference. First operand 101 states and 240 transitions. Second operand 3 states. [2018-06-24 21:24:57,926 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:57,926 INFO ]: Finished difference Result 131 states and 295 transitions. [2018-06-24 21:24:57,927 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:24:57,927 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 21:24:57,927 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:57,929 INFO ]: With dead ends: 131 [2018-06-24 21:24:57,929 INFO ]: Without dead ends: 106 [2018-06-24 21:24:57,929 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-24 21:24:57,929 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-24 21:24:57,940 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-06-24 21:24:57,940 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-24 21:24:57,942 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 240 transitions. [2018-06-24 21:24:57,942 INFO ]: Start accepts. Automaton has 106 states and 240 transitions. Word has length 12 [2018-06-24 21:24:57,942 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:57,942 INFO ]: Abstraction has 106 states and 240 transitions. [2018-06-24 21:24:57,942 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:24:57,942 INFO ]: Start isEmpty. Operand 106 states and 240 transitions. [2018-06-24 21:24:57,946 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:24:57,946 INFO ]: Found error trace [2018-06-24 21:24:57,946 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:57,946 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:57,946 INFO ]: Analyzing trace with hash 1581339841, now seen corresponding path program 1 times [2018-06-24 21:24:57,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:57,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:57,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:57,947 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:57,947 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:57,977 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:58,058 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:24:58,059 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:24:58,059 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:24:58,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:58,138 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:58,141 INFO ]: Computing forward predicates... [2018-06-24 21:24:58,221 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:24:58,253 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:24:58,253 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-06-24 21:24:58,253 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:24:58,253 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:24:58,253 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:24:58,253 INFO ]: Start difference. First operand 106 states and 240 transitions. Second operand 6 states. [2018-06-24 21:24:58,465 WARN ]: Spent 109.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-06-24 21:24:58,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:58,938 INFO ]: Finished difference Result 232 states and 590 transitions. [2018-06-24 21:24:58,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:24:58,939 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-24 21:24:58,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:58,943 INFO ]: With dead ends: 232 [2018-06-24 21:24:58,943 INFO ]: Without dead ends: 232 [2018-06-24 21:24:58,944 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:24:58,944 INFO ]: Start minimizeSevpa. Operand 232 states. [2018-06-24 21:24:58,964 INFO ]: Finished minimizeSevpa. Reduced states from 232 to 122. [2018-06-24 21:24:58,965 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-24 21:24:58,967 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 284 transitions. [2018-06-24 21:24:58,967 INFO ]: Start accepts. Automaton has 122 states and 284 transitions. Word has length 12 [2018-06-24 21:24:58,967 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:58,967 INFO ]: Abstraction has 122 states and 284 transitions. [2018-06-24 21:24:58,967 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:24:58,967 INFO ]: Start isEmpty. Operand 122 states and 284 transitions. [2018-06-24 21:24:58,972 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:24:58,972 INFO ]: Found error trace [2018-06-24 21:24:58,972 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:58,972 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:58,972 INFO ]: Analyzing trace with hash -1346612716, now seen corresponding path program 1 times [2018-06-24 21:24:58,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:58,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:58,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:58,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:58,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:58,994 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:59,044 INFO ]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:24:59,044 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:24:59,044 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:24:59,045 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:24:59,045 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:24:59,045 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:24:59,045 INFO ]: Start difference. First operand 122 states and 284 transitions. Second operand 3 states. [2018-06-24 21:24:59,122 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:59,122 INFO ]: Finished difference Result 137 states and 316 transitions. [2018-06-24 21:24:59,122 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:24:59,122 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-24 21:24:59,122 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:59,124 INFO ]: With dead ends: 137 [2018-06-24 21:24:59,124 INFO ]: Without dead ends: 137 [2018-06-24 21:24:59,125 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-24 21:24:59,125 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-24 21:24:59,135 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-06-24 21:24:59,136 INFO ]: Start removeUnreachable. Operand 137 states. [2018-06-24 21:24:59,138 INFO ]: Finished removeUnreachable. Reduced from 137 states to 137 states and 316 transitions. [2018-06-24 21:24:59,138 INFO ]: Start accepts. Automaton has 137 states and 316 transitions. Word has length 18 [2018-06-24 21:24:59,138 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:59,138 INFO ]: Abstraction has 137 states and 316 transitions. [2018-06-24 21:24:59,138 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:24:59,138 INFO ]: Start isEmpty. Operand 137 states and 316 transitions. [2018-06-24 21:24:59,144 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 21:24:59,144 INFO ]: Found error trace [2018-06-24 21:24:59,144 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:59,144 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:59,144 INFO ]: Analyzing trace with hash -52383235, now seen corresponding path program 1 times [2018-06-24 21:24:59,144 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:59,144 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:59,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:59,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:59,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:59,208 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:59,483 INFO ]: Checked inductivity of 35 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:24:59,483 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:24:59,483 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:24:59,492 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:59,633 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:59,639 INFO ]: Computing forward predicates... [2018-06-24 21:24:59,714 INFO ]: Checked inductivity of 35 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 21:24:59,736 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:24:59,736 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-24 21:24:59,736 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:24:59,737 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:24:59,737 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:24:59,737 INFO ]: Start difference. First operand 137 states and 316 transitions. Second operand 12 states. [2018-06-24 21:25:02,532 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:25:02,533 INFO ]: Finished difference Result 374 states and 1154 transitions. [2018-06-24 21:25:02,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-24 21:25:02,533 INFO ]: Start accepts. Automaton has 12 states. Word has length 28 [2018-06-24 21:25:02,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:25:02,545 INFO ]: With dead ends: 374 [2018-06-24 21:25:02,545 INFO ]: Without dead ends: 374 [2018-06-24 21:25:02,546 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=358, Invalid=2398, Unknown=0, NotChecked=0, Total=2756 [2018-06-24 21:25:02,546 INFO ]: Start minimizeSevpa. Operand 374 states. [2018-06-24 21:25:02,605 INFO ]: Finished minimizeSevpa. Reduced states from 374 to 178. [2018-06-24 21:25:02,605 INFO ]: Start removeUnreachable. Operand 178 states. [2018-06-24 21:25:02,608 INFO ]: Finished removeUnreachable. Reduced from 178 states to 178 states and 426 transitions. [2018-06-24 21:25:02,608 INFO ]: Start accepts. Automaton has 178 states and 426 transitions. Word has length 28 [2018-06-24 21:25:02,608 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:25:02,608 INFO ]: Abstraction has 178 states and 426 transitions. [2018-06-24 21:25:02,608 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:25:02,609 INFO ]: Start isEmpty. Operand 178 states and 426 transitions. [2018-06-24 21:25:02,620 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 21:25:02,620 INFO ]: Found error trace [2018-06-24 21:25:02,620 INFO ]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:25:02,620 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:25:02,620 INFO ]: Analyzing trace with hash 1757642800, now seen corresponding path program 1 times [2018-06-24 21:25:02,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:25:02,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:25:02,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:02,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:02,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:02,656 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:02,878 INFO ]: Checked inductivity of 59 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 21:25:02,878 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:25:02,878 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-24 21:25:02,892 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-24 21:25:03,031 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:03,037 INFO ]: Computing forward predicates... [2018-06-24 21:25:03,074 INFO ]: Checked inductivity of 59 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-24 21:25:03,107 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:25:03,107 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-06-24 21:25:03,108 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:25:03,108 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:25:03,108 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:25:03,108 INFO ]: Start difference. First operand 178 states and 426 transitions. Second operand 10 states. [2018-06-24 21:25:06,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:25:06,207 INFO ]: Finished difference Result 748 states and 2836 transitions. [2018-06-24 21:25:06,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-24 21:25:06,207 INFO ]: Start accepts. Automaton has 10 states. Word has length 35 [2018-06-24 21:25:06,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:25:06,253 INFO ]: With dead ends: 748 [2018-06-24 21:25:06,253 INFO ]: Without dead ends: 748 [2018-06-24 21:25:06,255 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=678, Invalid=3744, Unknown=0, NotChecked=0, Total=4422 [2018-06-24 21:25:06,255 INFO ]: Start minimizeSevpa. Operand 748 states. [2018-06-24 21:25:06,393 INFO ]: Finished minimizeSevpa. Reduced states from 748 to 346. [2018-06-24 21:25:06,393 INFO ]: Start removeUnreachable. Operand 346 states. [2018-06-24 21:25:06,405 INFO ]: Finished removeUnreachable. Reduced from 346 states to 346 states and 851 transitions. [2018-06-24 21:25:06,405 INFO ]: Start accepts. Automaton has 346 states and 851 transitions. Word has length 35 [2018-06-24 21:25:06,405 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:25:06,405 INFO ]: Abstraction has 346 states and 851 transitions. [2018-06-24 21:25:06,405 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:25:06,405 INFO ]: Start isEmpty. Operand 346 states and 851 transitions. [2018-06-24 21:25:06,433 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 21:25:06,433 INFO ]: Found error trace [2018-06-24 21:25:06,433 INFO ]: trace histogram [7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:25:06,434 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:25:06,434 INFO ]: Analyzing trace with hash 648329131, now seen corresponding path program 1 times [2018-06-24 21:25:06,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:25:06,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:25:06,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:06,434 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:06,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:06,469 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:06,568 INFO ]: Checked inductivity of 82 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-24 21:25:06,568 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:25:06,568 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:25:06,568 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:25:06,568 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:25:06,568 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:25:06,568 INFO ]: Start difference. First operand 346 states and 851 transitions. Second operand 3 states. [2018-06-24 21:25:06,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:25:06,824 INFO ]: Finished difference Result 366 states and 890 transitions. [2018-06-24 21:25:06,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:25:06,827 INFO ]: Start accepts. Automaton has 3 states. Word has length 41 [2018-06-24 21:25:06,827 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:25:06,836 INFO ]: With dead ends: 366 [2018-06-24 21:25:06,836 INFO ]: Without dead ends: 366 [2018-06-24 21:25:06,836 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-24 21:25:06,837 INFO ]: Start minimizeSevpa. Operand 366 states. [2018-06-24 21:25:06,866 INFO ]: Finished minimizeSevpa. Reduced states from 366 to 364. [2018-06-24 21:25:06,866 INFO ]: Start removeUnreachable. Operand 364 states. [2018-06-24 21:25:06,873 INFO ]: Finished removeUnreachable. Reduced from 364 states to 364 states and 885 transitions. [2018-06-24 21:25:06,873 INFO ]: Start accepts. Automaton has 364 states and 885 transitions. Word has length 41 [2018-06-24 21:25:06,874 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:25:06,874 INFO ]: Abstraction has 364 states and 885 transitions. [2018-06-24 21:25:06,874 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:25:06,874 INFO ]: Start isEmpty. Operand 364 states and 885 transitions. [2018-06-24 21:25:06,902 INFO ]: Finished isEmpty. Found accepting run of length 56 [2018-06-24 21:25:06,902 INFO ]: Found error trace [2018-06-24 21:25:06,902 INFO ]: trace histogram [9, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:25:06,902 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:25:06,902 INFO ]: Analyzing trace with hash -1918954757, now seen corresponding path program 1 times [2018-06-24 21:25:06,902 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:25:06,902 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:25:06,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:06,903 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:06,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:06,942 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:07,474 INFO ]: Checked inductivity of 163 backedges. 71 proven. 9 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-24 21:25:07,475 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:25:07,475 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) [2018-06-24 21:25:07,494 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:25:07,751 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:07,767 INFO ]: Computing forward predicates... [2018-06-24 21:25:07,993 INFO ]: Checked inductivity of 163 backedges. 75 proven. 5 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-24 21:25:08,026 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:25:08,026 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-06-24 21:25:08,026 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:25:08,026 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:25:08,026 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:25:08,026 INFO ]: Start difference. First operand 364 states and 885 transitions. Second operand 15 states. [2018-06-24 21:25:14,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:25:14,806 INFO ]: Finished difference Result 888 states and 2962 transitions. [2018-06-24 21:25:14,807 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-06-24 21:25:14,807 INFO ]: Start accepts. Automaton has 15 states. Word has length 55 [2018-06-24 21:25:14,807 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:25:14,858 INFO ]: With dead ends: 888 [2018-06-24 21:25:14,858 INFO ]: Without dead ends: 888 [2018-06-24 21:25:14,861 INFO ]: 0 DeclaredPredicates, 164 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3048 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=766, Invalid=8164, Unknown=0, NotChecked=0, Total=8930 [2018-06-24 21:25:14,861 INFO ]: Start minimizeSevpa. Operand 888 states. [2018-06-24 21:25:14,991 INFO ]: Finished minimizeSevpa. Reduced states from 888 to 387. [2018-06-24 21:25:14,991 INFO ]: Start removeUnreachable. Operand 387 states. [2018-06-24 21:25:14,999 INFO ]: Finished removeUnreachable. Reduced from 387 states to 387 states and 945 transitions. [2018-06-24 21:25:14,999 INFO ]: Start accepts. Automaton has 387 states and 945 transitions. Word has length 55 [2018-06-24 21:25:14,999 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:25:14,999 INFO ]: Abstraction has 387 states and 945 transitions. [2018-06-24 21:25:14,999 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:25:14,999 INFO ]: Start isEmpty. Operand 387 states and 945 transitions. [2018-06-24 21:25:15,030 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-24 21:25:15,030 INFO ]: Found error trace [2018-06-24 21:25:15,031 INFO ]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:25:15,031 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:25:15,031 INFO ]: Analyzing trace with hash -14273782, now seen corresponding path program 1 times [2018-06-24 21:25:15,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:25:15,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:25:15,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:15,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:15,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:15,046 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:15,221 INFO ]: Checked inductivity of 117 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-06-24 21:25:15,221 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:25:15,221 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:25:15,221 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:25:15,221 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:25:15,221 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:25:15,221 INFO ]: Start difference. First operand 387 states and 945 transitions. Second operand 4 states. [2018-06-24 21:25:15,499 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:25:15,499 INFO ]: Finished difference Result 468 states and 1407 transitions. [2018-06-24 21:25:15,500 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:25:15,500 INFO ]: Start accepts. Automaton has 4 states. Word has length 48 [2018-06-24 21:25:15,500 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:25:15,512 INFO ]: With dead ends: 468 [2018-06-24 21:25:15,512 INFO ]: Without dead ends: 468 [2018-06-24 21:25:15,512 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:25:15,513 INFO ]: Start minimizeSevpa. Operand 468 states. [2018-06-24 21:25:15,554 INFO ]: Finished minimizeSevpa. Reduced states from 468 to 332. [2018-06-24 21:25:15,554 INFO ]: Start removeUnreachable. Operand 332 states. [2018-06-24 21:25:15,559 INFO ]: Finished removeUnreachable. Reduced from 332 states to 332 states and 834 transitions. [2018-06-24 21:25:15,559 INFO ]: Start accepts. Automaton has 332 states and 834 transitions. Word has length 48 [2018-06-24 21:25:15,559 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:25:15,559 INFO ]: Abstraction has 332 states and 834 transitions. [2018-06-24 21:25:15,559 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:25:15,559 INFO ]: Start isEmpty. Operand 332 states and 834 transitions. [2018-06-24 21:25:15,575 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-24 21:25:15,575 INFO ]: Found error trace [2018-06-24 21:25:15,575 INFO ]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:25:15,575 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:25:15,575 INFO ]: Analyzing trace with hash 1424929333, now seen corresponding path program 1 times [2018-06-24 21:25:15,575 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:25:15,575 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:25:15,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:15,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:15,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:15,640 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:16,581 INFO ]: Checked inductivity of 117 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 21:25:16,581 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:25:16,581 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-24 21:25:16,587 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:16,746 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:16,758 INFO ]: Computing forward predicates... [2018-06-24 21:25:16,872 INFO ]: Checked inductivity of 117 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-24 21:25:16,893 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:25:16,893 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2018-06-24 21:25:16,894 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:25:16,894 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:25:16,894 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:25:16,894 INFO ]: Start difference. First operand 332 states and 834 transitions. Second operand 19 states. [2018-06-24 21:25:19,210 WARN ]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-24 21:25:20,194 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-24 21:25:31,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:25:31,884 INFO ]: Finished difference Result 2222 states and 9229 transitions. [2018-06-24 21:25:31,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 335 states. [2018-06-24 21:25:31,885 INFO ]: Start accepts. Automaton has 19 states. Word has length 48 [2018-06-24 21:25:31,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:25:32,115 INFO ]: With dead ends: 2222 [2018-06-24 21:25:32,115 INFO ]: Without dead ends: 2222 [2018-06-24 21:25:32,128 INFO ]: 0 DeclaredPredicates, 475 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50954 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=6181, Invalid=111811, Unknown=0, NotChecked=0, Total=117992 [2018-06-24 21:25:32,129 INFO ]: Start minimizeSevpa. Operand 2222 states. [2018-06-24 21:25:32,544 INFO ]: Finished minimizeSevpa. Reduced states from 2222 to 599. [2018-06-24 21:25:32,544 INFO ]: Start removeUnreachable. Operand 599 states. [2018-06-24 21:25:32,558 INFO ]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1632 transitions. [2018-06-24 21:25:32,558 INFO ]: Start accepts. Automaton has 599 states and 1632 transitions. Word has length 48 [2018-06-24 21:25:32,558 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:25:32,558 INFO ]: Abstraction has 599 states and 1632 transitions. [2018-06-24 21:25:32,558 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:25:32,558 INFO ]: Start isEmpty. Operand 599 states and 1632 transitions. [2018-06-24 21:25:32,582 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-24 21:25:32,582 INFO ]: Found error trace [2018-06-24 21:25:32,582 INFO ]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:25:32,582 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:25:32,582 INFO ]: Analyzing trace with hash 1717413286, now seen corresponding path program 1 times [2018-06-24 21:25:32,582 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:25:32,582 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:25:32,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:32,583 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:32,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:32,629 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:33,146 INFO ]: Checked inductivity of 128 backedges. 62 proven. 18 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-24 21:25:33,146 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:25:33,146 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-24 21:25:33,152 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:33,310 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:33,316 INFO ]: Computing forward predicates... [2018-06-24 21:25:33,488 INFO ]: Checked inductivity of 128 backedges. 50 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-24 21:25:33,508 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:25:33,509 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-24 21:25:33,509 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:25:33,509 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:25:33,509 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:25:33,509 INFO ]: Start difference. First operand 599 states and 1632 transitions. Second operand 14 states. [2018-06-24 21:25:36,024 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:25:36,025 INFO ]: Finished difference Result 2020 states and 6933 transitions. [2018-06-24 21:25:36,025 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 21:25:36,025 INFO ]: Start accepts. Automaton has 14 states. Word has length 49 [2018-06-24 21:25:36,025 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:25:36,175 INFO ]: With dead ends: 2020 [2018-06-24 21:25:36,175 INFO ]: Without dead ends: 2020 [2018-06-24 21:25:36,175 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=410, Invalid=1752, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 21:25:36,176 INFO ]: Start minimizeSevpa. Operand 2020 states. [2018-06-24 21:25:36,474 INFO ]: Finished minimizeSevpa. Reduced states from 2020 to 956. [2018-06-24 21:25:36,474 INFO ]: Start removeUnreachable. Operand 956 states. [2018-06-24 21:25:36,520 INFO ]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2797 transitions. [2018-06-24 21:25:36,520 INFO ]: Start accepts. Automaton has 956 states and 2797 transitions. Word has length 49 [2018-06-24 21:25:36,520 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:25:36,520 INFO ]: Abstraction has 956 states and 2797 transitions. [2018-06-24 21:25:36,520 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:25:36,520 INFO ]: Start isEmpty. Operand 956 states and 2797 transitions. [2018-06-24 21:25:36,588 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-24 21:25:36,588 INFO ]: Found error trace [2018-06-24 21:25:36,588 INFO ]: trace histogram [14, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:25:36,588 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:25:36,588 INFO ]: Analyzing trace with hash 519880321, now seen corresponding path program 1 times [2018-06-24 21:25:36,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:25:36,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:25:36,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:36,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:36,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:36,645 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:37,172 INFO ]: Checked inductivity of 420 backedges. 108 proven. 25 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2018-06-24 21:25:37,172 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:25:37,172 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-24 21:25:37,180 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:37,565 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:37,576 INFO ]: Computing forward predicates... [2018-06-24 21:25:37,839 INFO ]: Checked inductivity of 420 backedges. 151 proven. 5 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-06-24 21:25:37,876 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:25:37,876 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-24 21:25:37,876 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:25:37,877 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:25:37,877 INFO ]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:25:37,877 INFO ]: Start difference. First operand 956 states and 2797 transitions. Second operand 16 states. Received shutdown request... [2018-06-24 21:25:38,054 WARN ]: Removed 3 from assertion stack [2018-06-24 21:25:38,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:25:38,054 WARN ]: Verification canceled [2018-06-24 21:25:38,057 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:25:38,057 WARN ]: Timeout [2018-06-24 21:25:38,058 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:25:38 BasicIcfg [2018-06-24 21:25:38,058 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:25:38,058 INFO ]: Toolchain (without parser) took 59100.29 ms. Allocated memory was 309.9 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 236.3 MB in the beginning and 1.1 GB in the end (delta: -865.8 MB). Peak memory consumption was 234.6 MB. Max. memory is 3.6 GB. [2018-06-24 21:25:38,059 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 275.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:25:38,059 INFO ]: ChcToBoogie took 98.00 ms. Allocated memory is still 309.9 MB. Free memory was 236.3 MB in the beginning and 233.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:25:38,060 INFO ]: Boogie Preprocessor took 87.66 ms. Allocated memory is still 309.9 MB. Free memory was 233.3 MB in the beginning and 231.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:25:38,060 INFO ]: RCFGBuilder took 1158.27 ms. Allocated memory was 309.9 MB in the beginning and 325.1 MB in the end (delta: 15.2 MB). Free memory was 231.3 MB in the beginning and 291.0 MB in the end (delta: -59.7 MB). Peak memory consumption was 48.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:25:38,060 INFO ]: BlockEncodingV2 took 12084.49 ms. Allocated memory was 325.1 MB in the beginning and 367.0 MB in the end (delta: 41.9 MB). Free memory was 291.0 MB in the beginning and 206.9 MB in the end (delta: 84.1 MB). Peak memory consumption was 136.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:25:38,060 INFO ]: TraceAbstraction took 45661.07 ms. Allocated memory was 367.0 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 206.9 MB in the beginning and 1.1 GB in the end (delta: -895.2 MB). Peak memory consumption was 148.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:25:38,063 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 49 locations, 79 edges - StatisticsResult: Encoded RCFG 31 locations, 118 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 275.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 98.00 ms. Allocated memory is still 309.9 MB. Free memory was 236.3 MB in the beginning and 233.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 87.66 ms. Allocated memory is still 309.9 MB. Free memory was 233.3 MB in the beginning and 231.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1158.27 ms. Allocated memory was 309.9 MB in the beginning and 325.1 MB in the end (delta: 15.2 MB). Free memory was 231.3 MB in the beginning and 291.0 MB in the end (delta: -59.7 MB). Peak memory consumption was 48.4 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 12084.49 ms. Allocated memory was 325.1 MB in the beginning and 367.0 MB in the end (delta: 41.9 MB). Free memory was 291.0 MB in the beginning and 206.9 MB in the end (delta: 84.1 MB). Peak memory consumption was 136.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 45661.07 ms. Allocated memory was 367.0 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 206.9 MB in the beginning and 1.1 GB in the end (delta: -895.2 MB). Peak memory consumption was 148.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (956states) and interpolant automaton (currently 14 states, 16 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 8. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. TIMEOUT Result, 45.6s OverallTime, 17 OverallIterations, 14 TraceHistogramMax, 35.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2186 SDtfs, 2220 SDslu, 9831 SDs, 0 SdLazy, 27684 SolverSat, 3812 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1114 GetRequests, 456 SyntacticMatches, 1 SemanticMatches, 656 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56885 ImplicationChecksByTransitivity, 13.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=956occurred 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: 1.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 4181 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 798 NumberOfCodeBlocks, 798 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 773 ConstructedInterpolants, 0 QuantifiedInterpolants, 63260 SizeOfPredicates, 63 NumberOfNonLiveVariables, 10471 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 1943/2085 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann04.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-25-38-073.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann04.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-25-38-073.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann04.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-25-38-073.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann04.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-25-38-073.csv Completed graceful shutdown