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/hcai-bench/arrays_orig/array_fill2_abstracted.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:13:23,182 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:13:23,184 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:13:23,196 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:13:23,196 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:13:23,197 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:13:23,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:13:23,205 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:13:23,207 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:13:23,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:13:23,210 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:13:23,210 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:13:23,211 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:13:23,212 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:13:23,213 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:13:23,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:13:23,214 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:13:23,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:13:23,218 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:13:23,219 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:13:23,220 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:13:23,221 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:13:23,223 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:13:23,223 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:13:23,224 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:13:23,224 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:13:23,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:13:23,226 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:13:23,226 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:13:23,227 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:13:23,228 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:13:23,228 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:13:23,228 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:13:23,229 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:13:23,229 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:13:23,230 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:13:23,230 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:13:23,243 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:13:23,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:13:23,244 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:13:23,244 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:13:23,245 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:13:23,246 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:13:23,246 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:13:23,246 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:13:23,246 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:13:23,246 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:13:23,247 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:13:23,247 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:13:23,247 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:13:23,247 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:13:23,247 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:13:23,248 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:13:23,248 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:13:23,248 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:13:23,248 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:13:23,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:13:23,249 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:13:23,250 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:13:23,250 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:13:23,292 INFO ]: Repository-Root is: /tmp [2018-06-26 18:13:23,306 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:13:23,309 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:13:23,310 INFO ]: Initializing SmtParser... [2018-06-26 18:13:23,310 INFO ]: SmtParser initialized [2018-06-26 18:13:23,311 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hcai-bench/arrays_orig/array_fill2_abstracted.smt2 [2018-06-26 18:13:23,312 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 18:13:23,401 INFO ]: Executing SMT file /storage/chc-comp/hcai-bench/arrays_orig/array_fill2_abstracted.smt2 unknown [2018-06-26 18:13:23,642 INFO ]: Succesfully executed SMT file /storage/chc-comp/hcai-bench/arrays_orig/array_fill2_abstracted.smt2 [2018-06-26 18:13:23,649 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:13:23,654 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:13:23,655 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:13:23,655 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:13:23,655 INFO ]: ChcToBoogie initialized [2018-06-26 18:13:23,658 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:13:23" (1/1) ... [2018-06-26 18:13:23,712 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:23 Unit [2018-06-26 18:13:23,712 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:13:23,713 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:13:23,713 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:13:23,713 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:13:23,735 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:23" (1/1) ... [2018-06-26 18:13:23,735 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:23" (1/1) ... [2018-06-26 18:13:23,741 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:23" (1/1) ... [2018-06-26 18:13:23,741 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:23" (1/1) ... [2018-06-26 18:13:23,744 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:23" (1/1) ... [2018-06-26 18:13:23,745 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:23" (1/1) ... [2018-06-26 18:13:23,746 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:23" (1/1) ... [2018-06-26 18:13:23,748 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:13:23,748 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:13:23,748 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:13:23,748 INFO ]: RCFGBuilder initialized [2018-06-26 18:13:23,749 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:23" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 18:13:23,768 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:13:23,768 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:13:23,768 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:13:23,768 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:13:23,768 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:13:23,768 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:13:24,039 INFO ]: Using library mode [2018-06-26 18:13:24,040 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:13:24 BoogieIcfgContainer [2018-06-26 18:13:24,040 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:13:24,040 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:13:24,040 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:13:24,041 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:13:24,042 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:13:24" (1/1) ... [2018-06-26 18:13:24,057 INFO ]: Initial Icfg 16 locations, 18 edges [2018-06-26 18:13:24,059 INFO ]: Using Remove infeasible edges [2018-06-26 18:13:24,059 INFO ]: Using Maximize final states [2018-06-26 18:13:24,060 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:13:24,060 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:13:24,061 INFO ]: Using Remove sink states [2018-06-26 18:13:24,062 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:13:24,062 INFO ]: Using Use SBE [2018-06-26 18:13:24,078 INFO ]: SBE split 1 edges [2018-06-26 18:13:24,083 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 18:13:24,084 INFO ]: 0 new accepting states [2018-06-26 18:13:24,312 INFO ]: Removed 25 edges and 8 locations by large block encoding [2018-06-26 18:13:24,313 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:13:24,315 INFO ]: Removed 1 edges and 0 locations because of local infeasibility [2018-06-26 18:13:24,315 INFO ]: 0 new accepting states [2018-06-26 18:13:24,315 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:13:24,315 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:13:24,320 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:13:24,320 INFO ]: 0 new accepting states [2018-06-26 18:13:24,321 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:13:24,321 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:13:24,321 INFO ]: Encoded RCFG 6 locations, 9 edges [2018-06-26 18:13:24,321 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:13:24 BasicIcfg [2018-06-26 18:13:24,321 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:13:24,322 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:13:24,322 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:13:24,327 INFO ]: TraceAbstraction initialized [2018-06-26 18:13:24,327 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:13:23" (1/4) ... [2018-06-26 18:13:24,328 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca451a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:13:24, skipping insertion in model container [2018-06-26 18:13:24,328 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:13:23" (2/4) ... [2018-06-26 18:13:24,328 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca451a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:13:24, skipping insertion in model container [2018-06-26 18:13:24,328 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:13:24" (3/4) ... [2018-06-26 18:13:24,328 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca451a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:13:24, skipping insertion in model container [2018-06-26 18:13:24,329 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:13:24" (4/4) ... [2018-06-26 18:13:24,330 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:13:24,339 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:13:24,348 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:13:24,387 INFO ]: Using default assertion order modulation [2018-06-26 18:13:24,387 INFO ]: Interprodecural is true [2018-06-26 18:13:24,387 INFO ]: Hoare is false [2018-06-26 18:13:24,387 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:13:24,387 INFO ]: Backedges is TWOTRACK [2018-06-26 18:13:24,387 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:13:24,387 INFO ]: Difference is false [2018-06-26 18:13:24,387 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:13:24,387 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:13:24,399 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 18:13:24,414 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:13:24,414 INFO ]: Found error trace [2018-06-26 18:13:24,415 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:13:24,415 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:24,422 INFO ]: Analyzing trace with hash 34176584, now seen corresponding path program 1 times [2018-06-26 18:13:24,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:24,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:24,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:24,468 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:24,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:24,518 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:24,584 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:24,586 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:13:24,586 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:13:24,587 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:13:24,597 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:13:24,597 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:13:24,599 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 18:13:24,761 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:24,761 INFO ]: Finished difference Result 7 states and 13 transitions. [2018-06-26 18:13:24,761 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:13:24,763 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:13:24,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:24,771 INFO ]: With dead ends: 7 [2018-06-26 18:13:24,771 INFO ]: Without dead ends: 7 [2018-06-26 18:13:24,773 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:13:24,790 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 18:13:24,808 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 18:13:24,810 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 18:13:24,810 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2018-06-26 18:13:24,811 INFO ]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 5 [2018-06-26 18:13:24,812 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:24,812 INFO ]: Abstraction has 7 states and 13 transitions. [2018-06-26 18:13:24,812 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:13:24,812 INFO ]: Start isEmpty. Operand 7 states and 13 transitions. [2018-06-26 18:13:24,813 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:13:24,813 INFO ]: Found error trace [2018-06-26 18:13:24,813 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:13:24,813 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:24,813 INFO ]: Analyzing trace with hash 1059374267, now seen corresponding path program 1 times [2018-06-26 18:13:24,813 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:24,813 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:24,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:24,814 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:24,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:24,859 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:25,198 WARN ]: Spent 210.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-06-26 18:13:25,284 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:25,285 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:25,285 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:13:25,294 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:25,339 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:25,345 INFO ]: Computing forward predicates... [2018-06-26 18:13:25,481 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:25,501 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:25,501 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 18:13:25,502 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:13:25,502 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:13:25,502 INFO ]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:13:25,502 INFO ]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2018-06-26 18:13:25,587 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:25,587 INFO ]: Finished difference Result 8 states and 17 transitions. [2018-06-26 18:13:25,588 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:13:25,588 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-26 18:13:25,588 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:25,588 INFO ]: With dead ends: 8 [2018-06-26 18:13:25,588 INFO ]: Without dead ends: 8 [2018-06-26 18:13:25,589 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:13:25,589 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 18:13:25,590 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 18:13:25,590 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 18:13:25,590 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-06-26 18:13:25,590 INFO ]: Start accepts. Automaton has 8 states and 17 transitions. Word has length 6 [2018-06-26 18:13:25,590 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:25,590 INFO ]: Abstraction has 8 states and 17 transitions. [2018-06-26 18:13:25,590 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:13:25,590 INFO ]: Start isEmpty. Operand 8 states and 17 transitions. [2018-06-26 18:13:25,591 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:13:25,591 INFO ]: Found error trace [2018-06-26 18:13:25,591 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:13:25,591 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:25,591 INFO ]: Analyzing trace with hash 1059404058, now seen corresponding path program 1 times [2018-06-26 18:13:25,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:25,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:25,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:25,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:25,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:25,615 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:25,724 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:25,724 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:13:25,724 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:13:25,724 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:13:25,724 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:13:25,724 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:13:25,724 INFO ]: Start difference. First operand 8 states and 17 transitions. Second operand 4 states. [2018-06-26 18:13:25,841 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:25,841 INFO ]: Finished difference Result 13 states and 35 transitions. [2018-06-26 18:13:25,842 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:13:25,842 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 18:13:25,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:25,844 INFO ]: With dead ends: 13 [2018-06-26 18:13:25,844 INFO ]: Without dead ends: 13 [2018-06-26 18:13:25,845 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:13:25,845 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:13:25,847 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-26 18:13:25,847 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:13:25,848 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2018-06-26 18:13:25,848 INFO ]: Start accepts. Automaton has 12 states and 34 transitions. Word has length 6 [2018-06-26 18:13:25,848 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:25,848 INFO ]: Abstraction has 12 states and 34 transitions. [2018-06-26 18:13:25,848 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:13:25,848 INFO ]: Start isEmpty. Operand 12 states and 34 transitions. [2018-06-26 18:13:25,849 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:13:25,849 INFO ]: Found error trace [2018-06-26 18:13:25,849 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:13:25,849 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:25,849 INFO ]: Analyzing trace with hash 1059433849, now seen corresponding path program 1 times [2018-06-26 18:13:25,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:25,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:25,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:25,850 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:25,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:25,861 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:25,924 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:25,924 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:13:25,924 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:13:25,925 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:13:25,925 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:13:25,925 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:13:25,925 INFO ]: Start difference. First operand 12 states and 34 transitions. Second operand 3 states. [2018-06-26 18:13:25,943 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:25,943 INFO ]: Finished difference Result 12 states and 27 transitions. [2018-06-26 18:13:25,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:13:25,943 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:13:25,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:25,944 INFO ]: With dead ends: 12 [2018-06-26 18:13:25,944 INFO ]: Without dead ends: 12 [2018-06-26 18:13:25,944 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:13:25,944 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:13:25,945 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 18:13:25,946 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:13:25,946 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-06-26 18:13:25,946 INFO ]: Start accepts. Automaton has 12 states and 27 transitions. Word has length 6 [2018-06-26 18:13:25,946 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:25,946 INFO ]: Abstraction has 12 states and 27 transitions. [2018-06-26 18:13:25,946 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:13:25,946 INFO ]: Start isEmpty. Operand 12 states and 27 transitions. [2018-06-26 18:13:25,946 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:13:25,947 INFO ]: Found error trace [2018-06-26 18:13:25,947 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 18:13:25,947 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:25,947 INFO ]: Analyzing trace with hash -1519235928, now seen corresponding path program 2 times [2018-06-26 18:13:25,947 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:25,947 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:25,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:25,948 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:25,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:25,969 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:26,403 WARN ]: Spent 267.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2018-06-26 18:13:26,607 WARN ]: Spent 117.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-06-26 18:13:26,608 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:26,608 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:26,608 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:13:26,615 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:13:26,685 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:13:26,685 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:26,689 INFO ]: Computing forward predicates... [2018-06-26 18:13:26,880 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:26,900 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:26,900 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 18:13:26,900 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:13:26,901 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:13:26,901 INFO ]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:13:26,901 INFO ]: Start difference. First operand 12 states and 27 transitions. Second operand 8 states. [2018-06-26 18:13:26,951 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:26,951 INFO ]: Finished difference Result 14 states and 33 transitions. [2018-06-26 18:13:26,952 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:13:26,952 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-26 18:13:26,952 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:26,952 INFO ]: With dead ends: 14 [2018-06-26 18:13:26,952 INFO ]: Without dead ends: 14 [2018-06-26 18:13:26,953 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:13:26,953 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:13:26,954 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 18:13:26,954 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:13:26,955 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-06-26 18:13:26,955 INFO ]: Start accepts. Automaton has 14 states and 33 transitions. Word has length 7 [2018-06-26 18:13:26,955 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:26,955 INFO ]: Abstraction has 14 states and 33 transitions. [2018-06-26 18:13:26,955 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:13:26,955 INFO ]: Start isEmpty. Operand 14 states and 33 transitions. [2018-06-26 18:13:26,955 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:13:26,955 INFO ]: Found error trace [2018-06-26 18:13:26,955 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:13:26,956 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:26,956 INFO ]: Analyzing trace with hash -1522900221, now seen corresponding path program 1 times [2018-06-26 18:13:26,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:26,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:26,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:26,957 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:26,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:26,970 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:27,014 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:27,014 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:27,014 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-26 18:13:27,021 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:27,046 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:27,047 INFO ]: Computing forward predicates... [2018-06-26 18:13:27,055 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:27,076 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:27,076 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 18:13:27,077 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:13:27,077 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:13:27,077 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:13:27,077 INFO ]: Start difference. First operand 14 states and 33 transitions. Second operand 5 states. [2018-06-26 18:13:27,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:27,140 INFO ]: Finished difference Result 18 states and 42 transitions. [2018-06-26 18:13:27,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:13:27,141 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 18:13:27,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:27,141 INFO ]: With dead ends: 18 [2018-06-26 18:13:27,141 INFO ]: Without dead ends: 14 [2018-06-26 18:13:27,142 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:13:27,142 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:13:27,143 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 18:13:27,144 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:13:27,144 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2018-06-26 18:13:27,144 INFO ]: Start accepts. Automaton has 14 states and 31 transitions. Word has length 7 [2018-06-26 18:13:27,144 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:27,144 INFO ]: Abstraction has 14 states and 31 transitions. [2018-06-26 18:13:27,144 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:13:27,144 INFO ]: Start isEmpty. Operand 14 states and 31 transitions. [2018-06-26 18:13:27,145 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:13:27,145 INFO ]: Found error trace [2018-06-26 18:13:27,145 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-26 18:13:27,145 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:27,145 INFO ]: Analyzing trace with hash 148226651, now seen corresponding path program 3 times [2018-06-26 18:13:27,145 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:27,145 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:27,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:27,146 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:27,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:27,172 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:27,380 WARN ]: Spent 123.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2018-06-26 18:13:27,610 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:27,610 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:27,610 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:13:27,622 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:13:27,704 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:13:27,704 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:27,708 INFO ]: Computing forward predicates... [2018-06-26 18:13:28,123 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:28,143 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:28,143 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-26 18:13:28,143 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:13:28,143 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:13:28,143 INFO ]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:13:28,143 INFO ]: Start difference. First operand 14 states and 31 transitions. Second operand 10 states. [2018-06-26 18:13:28,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:28,198 INFO ]: Finished difference Result 16 states and 37 transitions. [2018-06-26 18:13:28,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:13:28,198 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-26 18:13:28,198 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:28,199 INFO ]: With dead ends: 16 [2018-06-26 18:13:28,199 INFO ]: Without dead ends: 16 [2018-06-26 18:13:28,199 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:13:28,199 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 18:13:28,201 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 18:13:28,201 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 18:13:28,201 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 37 transitions. [2018-06-26 18:13:28,201 INFO ]: Start accepts. Automaton has 16 states and 37 transitions. Word has length 8 [2018-06-26 18:13:28,202 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:28,202 INFO ]: Abstraction has 16 states and 37 transitions. [2018-06-26 18:13:28,202 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:13:28,202 INFO ]: Start isEmpty. Operand 16 states and 37 transitions. [2018-06-26 18:13:28,202 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:13:28,202 INFO ]: Found error trace [2018-06-26 18:13:28,202 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:13:28,202 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:28,202 INFO ]: Analyzing trace with hash 144562358, now seen corresponding path program 1 times [2018-06-26 18:13:28,202 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:28,202 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:28,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:28,203 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:28,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:28,215 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:28,328 INFO ]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:13:28,328 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:28,328 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-26 18:13:28,336 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:28,383 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:28,386 INFO ]: Computing forward predicates... [2018-06-26 18:13:28,495 INFO ]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:13:28,515 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:28,515 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 18:13:28,515 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:13:28,515 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:13:28,515 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:13:28,515 INFO ]: Start difference. First operand 16 states and 37 transitions. Second operand 6 states. [2018-06-26 18:13:28,583 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:28,583 INFO ]: Finished difference Result 21 states and 51 transitions. [2018-06-26 18:13:28,584 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:13:28,584 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-26 18:13:28,584 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:28,584 INFO ]: With dead ends: 21 [2018-06-26 18:13:28,584 INFO ]: Without dead ends: 16 [2018-06-26 18:13:28,585 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:13:28,585 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 18:13:28,588 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 18:13:28,588 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 18:13:28,588 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2018-06-26 18:13:28,588 INFO ]: Start accepts. Automaton has 16 states and 35 transitions. Word has length 8 [2018-06-26 18:13:28,588 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:28,588 INFO ]: Abstraction has 16 states and 35 transitions. [2018-06-26 18:13:28,588 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:13:28,588 INFO ]: Start isEmpty. Operand 16 states and 35 transitions. [2018-06-26 18:13:28,589 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:13:28,589 INFO ]: Found error trace [2018-06-26 18:13:28,589 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:13:28,589 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:28,589 INFO ]: Analyzing trace with hash 173191509, now seen corresponding path program 2 times [2018-06-26 18:13:28,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:28,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:28,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:28,590 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:28,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:28,605 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:28,780 INFO ]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:28,780 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:28,780 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-26 18:13:28,786 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:13:28,828 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:13:28,828 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:28,831 INFO ]: Computing forward predicates... [2018-06-26 18:13:29,335 WARN ]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-26 18:13:29,379 INFO ]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:29,399 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:29,399 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-26 18:13:29,399 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:13:29,400 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:13:29,400 INFO ]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:13:29,400 INFO ]: Start difference. First operand 16 states and 35 transitions. Second operand 10 states. [2018-06-26 18:13:29,496 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:29,496 INFO ]: Finished difference Result 24 states and 54 transitions. [2018-06-26 18:13:29,496 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:13:29,496 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-26 18:13:29,496 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:29,497 INFO ]: With dead ends: 24 [2018-06-26 18:13:29,497 INFO ]: Without dead ends: 24 [2018-06-26 18:13:29,497 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:13:29,497 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 18:13:29,500 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-06-26 18:13:29,500 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 18:13:29,501 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 52 transitions. [2018-06-26 18:13:29,501 INFO ]: Start accepts. Automaton has 22 states and 52 transitions. Word has length 8 [2018-06-26 18:13:29,501 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:29,501 INFO ]: Abstraction has 22 states and 52 transitions. [2018-06-26 18:13:29,501 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:13:29,501 INFO ]: Start isEmpty. Operand 22 states and 52 transitions. [2018-06-26 18:13:29,502 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:13:29,502 INFO ]: Found error trace [2018-06-26 18:13:29,502 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-26 18:13:29,502 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:29,502 INFO ]: Analyzing trace with hash 299959048, now seen corresponding path program 4 times [2018-06-26 18:13:29,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:29,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:29,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:29,503 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:29,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:29,525 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:29,840 WARN ]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 21 [2018-06-26 18:13:30,233 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 30 [2018-06-26 18:13:30,234 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:30,234 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:30,234 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) [2018-06-26 18:13:30,250 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:13:30,297 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:13:30,297 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:30,300 INFO ]: Computing forward predicates... [2018-06-26 18:13:30,442 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:30,461 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:30,461 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-26 18:13:30,461 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:13:30,462 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:13:30,462 INFO ]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:13:30,462 INFO ]: Start difference. First operand 22 states and 52 transitions. Second operand 12 states. [2018-06-26 18:13:30,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:30,497 INFO ]: Finished difference Result 25 states and 61 transitions. [2018-06-26 18:13:30,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:13:30,499 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-26 18:13:30,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:30,500 INFO ]: With dead ends: 25 [2018-06-26 18:13:30,500 INFO ]: Without dead ends: 25 [2018-06-26 18:13:30,500 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:13:30,500 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 18:13:30,502 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-26 18:13:30,503 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 18:13:30,503 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 61 transitions. [2018-06-26 18:13:30,503 INFO ]: Start accepts. Automaton has 25 states and 61 transitions. Word has length 9 [2018-06-26 18:13:30,503 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:30,503 INFO ]: Abstraction has 25 states and 61 transitions. [2018-06-26 18:13:30,503 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:13:30,503 INFO ]: Start isEmpty. Operand 25 states and 61 transitions. [2018-06-26 18:13:30,504 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:13:30,504 INFO ]: Found error trace [2018-06-26 18:13:30,504 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:13:30,504 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:30,504 INFO ]: Analyzing trace with hash 296294755, now seen corresponding path program 2 times [2018-06-26 18:13:30,504 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:30,504 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:30,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:30,505 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:30,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:30,515 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:30,609 INFO ]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:30,609 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:30,609 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-26 18:13:30,615 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:13:30,651 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:13:30,651 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:30,653 INFO ]: Computing forward predicates... [2018-06-26 18:13:30,665 INFO ]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:30,685 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:30,685 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-26 18:13:30,685 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:13:30,685 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:13:30,685 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:13:30,685 INFO ]: Start difference. First operand 25 states and 61 transitions. Second operand 7 states. [2018-06-26 18:13:30,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:30,740 INFO ]: Finished difference Result 35 states and 84 transitions. [2018-06-26 18:13:30,741 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:13:30,741 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-26 18:13:30,741 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:30,741 INFO ]: With dead ends: 35 [2018-06-26 18:13:30,741 INFO ]: Without dead ends: 35 [2018-06-26 18:13:30,742 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:13:30,742 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 18:13:30,745 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-06-26 18:13:30,745 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 18:13:30,746 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 79 transitions. [2018-06-26 18:13:30,746 INFO ]: Start accepts. Automaton has 32 states and 79 transitions. Word has length 9 [2018-06-26 18:13:30,746 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:30,746 INFO ]: Abstraction has 32 states and 79 transitions. [2018-06-26 18:13:30,746 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:13:30,746 INFO ]: Start isEmpty. Operand 32 states and 79 transitions. [2018-06-26 18:13:30,747 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:13:30,747 INFO ]: Found error trace [2018-06-26 18:13:30,747 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-26 18:13:30,747 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:30,747 INFO ]: Analyzing trace with hash 708696059, now seen corresponding path program 5 times [2018-06-26 18:13:30,747 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:30,747 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:30,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:30,748 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:30,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:30,774 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:31,203 WARN ]: Spent 184.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 31 [2018-06-26 18:13:31,354 WARN ]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 33 [2018-06-26 18:13:31,550 WARN ]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2018-06-26 18:13:31,551 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:31,551 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:31,551 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-26 18:13:31,564 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:13:31,600 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 18:13:31,600 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:31,603 INFO ]: Computing forward predicates... [2018-06-26 18:13:31,740 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:31,759 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:31,759 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-26 18:13:31,759 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:13:31,759 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:13:31,759 INFO ]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:13:31,760 INFO ]: Start difference. First operand 32 states and 79 transitions. Second operand 14 states. [2018-06-26 18:13:31,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:31,933 INFO ]: Finished difference Result 35 states and 88 transitions. [2018-06-26 18:13:31,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:13:31,936 INFO ]: Start accepts. Automaton has 14 states. Word has length 10 [2018-06-26 18:13:31,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:31,936 INFO ]: With dead ends: 35 [2018-06-26 18:13:31,936 INFO ]: Without dead ends: 35 [2018-06-26 18:13:31,937 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:13:31,937 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 18:13:31,939 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 18:13:31,939 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 18:13:31,940 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 88 transitions. [2018-06-26 18:13:31,940 INFO ]: Start accepts. Automaton has 35 states and 88 transitions. Word has length 10 [2018-06-26 18:13:31,940 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:31,940 INFO ]: Abstraction has 35 states and 88 transitions. [2018-06-26 18:13:31,940 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:13:31,940 INFO ]: Start isEmpty. Operand 35 states and 88 transitions. [2018-06-26 18:13:31,941 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:13:31,941 INFO ]: Found error trace [2018-06-26 18:13:31,941 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:13:31,941 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:31,941 INFO ]: Analyzing trace with hash 594209246, now seen corresponding path program 3 times [2018-06-26 18:13:31,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:31,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:31,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:31,942 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:31,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:31,958 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:32,237 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-26 18:13:32,360 INFO ]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:13:32,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:32,360 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-26 18:13:32,367 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:13:32,402 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 18:13:32,402 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:32,405 INFO ]: Computing forward predicates... [2018-06-26 18:13:32,543 INFO ]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:13:32,574 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:32,575 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-26 18:13:32,575 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:13:32,575 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:13:32,575 INFO ]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:13:32,575 INFO ]: Start difference. First operand 35 states and 88 transitions. Second operand 9 states. [2018-06-26 18:13:32,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:32,746 INFO ]: Finished difference Result 43 states and 109 transitions. [2018-06-26 18:13:32,747 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:13:32,747 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-26 18:13:32,747 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:32,748 INFO ]: With dead ends: 43 [2018-06-26 18:13:32,748 INFO ]: Without dead ends: 35 [2018-06-26 18:13:32,748 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:13:32,749 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 18:13:32,751 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 18:13:32,752 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 18:13:32,754 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 85 transitions. [2018-06-26 18:13:32,754 INFO ]: Start accepts. Automaton has 35 states and 85 transitions. Word has length 10 [2018-06-26 18:13:32,754 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:32,754 INFO ]: Abstraction has 35 states and 85 transitions. [2018-06-26 18:13:32,754 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:13:32,754 INFO ]: Start isEmpty. Operand 35 states and 85 transitions. [2018-06-26 18:13:32,755 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:13:32,755 INFO ]: Found error trace [2018-06-26 18:13:32,755 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-26 18:13:32,755 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:32,755 INFO ]: Analyzing trace with hash -1073543472, now seen corresponding path program 3 times [2018-06-26 18:13:32,755 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:32,755 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:32,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:32,756 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:32,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:32,769 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:33,083 WARN ]: Spent 249.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-06-26 18:13:33,462 WARN ]: Spent 334.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-06-26 18:13:33,702 INFO ]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:33,702 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:33,702 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-26 18:13:33,708 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:13:33,744 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 18:13:33,744 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:33,747 INFO ]: Computing forward predicates... [2018-06-26 18:13:33,982 INFO ]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:34,002 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:34,002 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-26 18:13:34,002 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:13:34,002 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:13:34,002 INFO ]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:13:34,002 INFO ]: Start difference. First operand 35 states and 85 transitions. Second operand 12 states. [2018-06-26 18:13:34,209 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:34,209 INFO ]: Finished difference Result 49 states and 117 transitions. [2018-06-26 18:13:34,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:13:34,209 INFO ]: Start accepts. Automaton has 12 states. Word has length 10 [2018-06-26 18:13:34,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:34,209 INFO ]: With dead ends: 49 [2018-06-26 18:13:34,209 INFO ]: Without dead ends: 49 [2018-06-26 18:13:34,210 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:13:34,210 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-26 18:13:34,214 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-06-26 18:13:34,214 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-26 18:13:34,215 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 114 transitions. [2018-06-26 18:13:34,215 INFO ]: Start accepts. Automaton has 46 states and 114 transitions. Word has length 10 [2018-06-26 18:13:34,215 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:34,215 INFO ]: Abstraction has 46 states and 114 transitions. [2018-06-26 18:13:34,215 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:13:34,215 INFO ]: Start isEmpty. Operand 46 states and 114 transitions. [2018-06-26 18:13:34,215 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:13:34,215 INFO ]: Found error trace [2018-06-26 18:13:34,215 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-26 18:13:34,215 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:34,216 INFO ]: Analyzing trace with hash 494641512, now seen corresponding path program 6 times [2018-06-26 18:13:34,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:34,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:34,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:34,216 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:34,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:34,232 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:34,566 WARN ]: Spent 221.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2018-06-26 18:13:35,021 WARN ]: Spent 403.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-06-26 18:13:35,245 WARN ]: Spent 147.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 20 [2018-06-26 18:13:35,486 WARN ]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2018-06-26 18:13:35,738 WARN ]: Spent 214.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2018-06-26 18:13:36,140 WARN ]: Spent 217.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2018-06-26 18:13:36,141 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:36,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:36,141 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:13:36,149 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:13:36,189 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 18:13:36,189 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:36,192 INFO ]: Computing forward predicates... [2018-06-26 18:13:36,591 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:36,610 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:36,611 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-26 18:13:36,611 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:13:36,611 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:13:36,611 INFO ]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:13:36,611 INFO ]: Start difference. First operand 46 states and 114 transitions. Second operand 16 states. [2018-06-26 18:13:36,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:36,660 INFO ]: Finished difference Result 50 states and 126 transitions. [2018-06-26 18:13:36,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:13:36,663 INFO ]: Start accepts. Automaton has 16 states. Word has length 11 [2018-06-26 18:13:36,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:36,664 INFO ]: With dead ends: 50 [2018-06-26 18:13:36,664 INFO ]: Without dead ends: 50 [2018-06-26 18:13:36,665 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:13:36,665 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-26 18:13:36,668 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-26 18:13:36,668 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-26 18:13:36,669 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 126 transitions. [2018-06-26 18:13:36,669 INFO ]: Start accepts. Automaton has 50 states and 126 transitions. Word has length 11 [2018-06-26 18:13:36,669 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:36,669 INFO ]: Abstraction has 50 states and 126 transitions. [2018-06-26 18:13:36,669 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:13:36,669 INFO ]: Start isEmpty. Operand 50 states and 126 transitions. [2018-06-26 18:13:36,670 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:13:36,670 INFO ]: Found error trace [2018-06-26 18:13:36,670 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:13:36,670 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:36,670 INFO ]: Analyzing trace with hash 380154699, now seen corresponding path program 4 times [2018-06-26 18:13:36,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:36,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:36,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:36,671 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:36,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:36,682 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:37,020 INFO ]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:37,020 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:37,020 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:13:37,025 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:13:37,070 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:13:37,070 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:37,072 INFO ]: Computing forward predicates... [2018-06-26 18:13:37,083 INFO ]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:37,102 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:37,102 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-26 18:13:37,103 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:13:37,103 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:13:37,103 INFO ]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:13:37,103 INFO ]: Start difference. First operand 50 states and 126 transitions. Second operand 9 states. [2018-06-26 18:13:37,200 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:37,200 INFO ]: Finished difference Result 74 states and 177 transitions. [2018-06-26 18:13:37,201 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:13:37,202 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-26 18:13:37,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:37,202 INFO ]: With dead ends: 74 [2018-06-26 18:13:37,202 INFO ]: Without dead ends: 74 [2018-06-26 18:13:37,202 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:13:37,202 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-26 18:13:37,207 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-06-26 18:13:37,207 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-26 18:13:37,208 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 163 transitions. [2018-06-26 18:13:37,208 INFO ]: Start accepts. Automaton has 66 states and 163 transitions. Word has length 11 [2018-06-26 18:13:37,208 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:37,208 INFO ]: Abstraction has 66 states and 163 transitions. [2018-06-26 18:13:37,208 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:13:37,208 INFO ]: Start isEmpty. Operand 66 states and 163 transitions. [2018-06-26 18:13:37,209 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:13:37,209 INFO ]: Found error trace [2018-06-26 18:13:37,209 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-26 18:13:37,209 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:37,209 INFO ]: Analyzing trace with hash -1846082149, now seen corresponding path program 7 times [2018-06-26 18:13:37,209 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:37,209 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:37,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:37,210 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:37,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:37,229 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:37,620 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2018-06-26 18:13:38,082 WARN ]: Spent 300.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 44 [2018-06-26 18:13:38,529 WARN ]: Spent 395.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 48 [2018-06-26 18:13:38,865 WARN ]: Spent 290.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 53 [2018-06-26 18:13:38,866 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:38,866 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:38,866 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:13:38,871 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:38,925 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:38,930 INFO ]: Computing forward predicates... [2018-06-26 18:13:39,158 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:39,177 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:39,177 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-26 18:13:39,177 INFO ]: Interpolant automaton has 18 states [2018-06-26 18:13:39,177 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 18:13:39,177 INFO ]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:13:39,177 INFO ]: Start difference. First operand 66 states and 163 transitions. Second operand 18 states. [2018-06-26 18:13:39,205 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:39,205 INFO ]: Finished difference Result 70 states and 175 transitions. [2018-06-26 18:13:39,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:13:39,205 INFO ]: Start accepts. Automaton has 18 states. Word has length 12 [2018-06-26 18:13:39,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:39,206 INFO ]: With dead ends: 70 [2018-06-26 18:13:39,206 INFO ]: Without dead ends: 70 [2018-06-26 18:13:39,206 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:13:39,206 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-26 18:13:39,210 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-26 18:13:39,210 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-26 18:13:39,213 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 175 transitions. [2018-06-26 18:13:39,213 INFO ]: Start accepts. Automaton has 70 states and 175 transitions. Word has length 12 [2018-06-26 18:13:39,213 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:39,213 INFO ]: Abstraction has 70 states and 175 transitions. [2018-06-26 18:13:39,213 INFO ]: Interpolant automaton has 18 states. [2018-06-26 18:13:39,213 INFO ]: Start isEmpty. Operand 70 states and 175 transitions. [2018-06-26 18:13:39,214 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:13:39,214 INFO ]: Found error trace [2018-06-26 18:13:39,214 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:13:39,214 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:39,214 INFO ]: Analyzing trace with hash -1101099786, now seen corresponding path program 5 times [2018-06-26 18:13:39,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:39,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:39,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:39,214 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:39,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:39,227 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:39,543 WARN ]: Spent 231.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-06-26 18:13:39,699 INFO ]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:13:39,699 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:39,699 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:13:39,704 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:13:39,791 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-26 18:13:39,791 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:39,794 INFO ]: Computing forward predicates... [2018-06-26 18:13:39,873 INFO ]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:39,892 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:39,892 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-06-26 18:13:39,892 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:13:39,892 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:13:39,892 INFO ]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:13:39,892 INFO ]: Start difference. First operand 70 states and 175 transitions. Second operand 14 states. [2018-06-26 18:13:40,113 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2018-06-26 18:13:40,932 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:40,933 INFO ]: Finished difference Result 159 states and 407 transitions. [2018-06-26 18:13:40,933 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 18:13:40,933 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-26 18:13:40,933 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:40,934 INFO ]: With dead ends: 159 [2018-06-26 18:13:40,934 INFO ]: Without dead ends: 159 [2018-06-26 18:13:40,934 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=297, Invalid=1109, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 18:13:40,934 INFO ]: Start minimizeSevpa. Operand 159 states. [2018-06-26 18:13:40,942 INFO ]: Finished minimizeSevpa. Reduced states from 159 to 117. [2018-06-26 18:13:40,942 INFO ]: Start removeUnreachable. Operand 117 states. [2018-06-26 18:13:41,044 INFO ]: Finished removeUnreachable. Reduced from 117 states to 117 states and 298 transitions. [2018-06-26 18:13:41,044 INFO ]: Start accepts. Automaton has 117 states and 298 transitions. Word has length 12 [2018-06-26 18:13:41,044 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:41,044 INFO ]: Abstraction has 117 states and 298 transitions. [2018-06-26 18:13:41,044 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:13:41,044 INFO ]: Start isEmpty. Operand 117 states and 298 transitions. [2018-06-26 18:13:41,045 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:13:41,045 INFO ]: Found error trace [2018-06-26 18:13:41,045 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-06-26 18:13:41,045 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:41,046 INFO ]: Analyzing trace with hash -889984629, now seen corresponding path program 4 times [2018-06-26 18:13:41,046 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:41,046 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:41,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:41,046 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:41,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:41,062 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:41,547 WARN ]: Spent 325.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2018-06-26 18:13:42,032 INFO ]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:42,032 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:42,032 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:13:42,038 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:13:42,082 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:13:42,082 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:42,085 INFO ]: Computing forward predicates... [2018-06-26 18:13:42,439 WARN ]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-26 18:13:43,120 WARN ]: Spent 288.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2018-06-26 18:13:43,170 INFO ]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:43,189 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:43,189 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-26 18:13:43,189 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:13:43,189 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:13:43,189 INFO ]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:13:43,189 INFO ]: Start difference. First operand 117 states and 298 transitions. Second operand 16 states. [2018-06-26 18:13:43,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:43,466 INFO ]: Finished difference Result 183 states and 461 transitions. [2018-06-26 18:13:43,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:13:43,467 INFO ]: Start accepts. Automaton has 16 states. Word has length 12 [2018-06-26 18:13:43,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:43,467 INFO ]: With dead ends: 183 [2018-06-26 18:13:43,467 INFO ]: Without dead ends: 183 [2018-06-26 18:13:43,468 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-06-26 18:13:43,468 INFO ]: Start minimizeSevpa. Operand 183 states. [2018-06-26 18:13:43,477 INFO ]: Finished minimizeSevpa. Reduced states from 183 to 154. [2018-06-26 18:13:43,477 INFO ]: Start removeUnreachable. Operand 154 states. [2018-06-26 18:13:43,480 INFO ]: Finished removeUnreachable. Reduced from 154 states to 154 states and 391 transitions. [2018-06-26 18:13:43,480 INFO ]: Start accepts. Automaton has 154 states and 391 transitions. Word has length 12 [2018-06-26 18:13:43,480 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:43,480 INFO ]: Abstraction has 154 states and 391 transitions. [2018-06-26 18:13:43,480 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:13:43,480 INFO ]: Start isEmpty. Operand 154 states and 391 transitions. [2018-06-26 18:13:43,481 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:13:43,481 INFO ]: Found error trace [2018-06-26 18:13:43,481 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-26 18:13:43,481 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:43,481 INFO ]: Analyzing trace with hash -1394071608, now seen corresponding path program 8 times [2018-06-26 18:13:43,481 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:43,481 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:43,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:43,482 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:43,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:43,497 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:43,903 WARN ]: Spent 232.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2018-06-26 18:13:44,253 WARN ]: Spent 299.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 16 [2018-06-26 18:13:44,993 WARN ]: Spent 310.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 45 [2018-06-26 18:13:45,461 WARN ]: Spent 320.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 58 [2018-06-26 18:13:45,820 WARN ]: Spent 298.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 56 [2018-06-26 18:13:45,822 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:45,822 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:45,822 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:13:45,827 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:13:45,903 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:13:45,903 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:45,908 INFO ]: Computing forward predicates... [2018-06-26 18:13:46,261 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:46,279 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:46,279 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-26 18:13:46,279 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:13:46,279 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:13:46,279 INFO ]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:13:46,279 INFO ]: Start difference. First operand 154 states and 391 transitions. Second operand 20 states. [2018-06-26 18:13:46,311 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:46,311 INFO ]: Finished difference Result 172 states and 443 transitions. [2018-06-26 18:13:46,311 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:13:46,311 INFO ]: Start accepts. Automaton has 20 states. Word has length 13 [2018-06-26 18:13:46,311 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:46,312 INFO ]: With dead ends: 172 [2018-06-26 18:13:46,312 INFO ]: Without dead ends: 172 [2018-06-26 18:13:46,312 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:13:46,312 INFO ]: Start minimizeSevpa. Operand 172 states. [2018-06-26 18:13:46,317 INFO ]: Finished minimizeSevpa. Reduced states from 172 to 159. [2018-06-26 18:13:46,317 INFO ]: Start removeUnreachable. Operand 159 states. [2018-06-26 18:13:46,325 INFO ]: Finished removeUnreachable. Reduced from 159 states to 159 states and 406 transitions. [2018-06-26 18:13:46,325 INFO ]: Start accepts. Automaton has 159 states and 406 transitions. Word has length 13 [2018-06-26 18:13:46,325 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:46,325 INFO ]: Abstraction has 159 states and 406 transitions. [2018-06-26 18:13:46,325 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:13:46,325 INFO ]: Start isEmpty. Operand 159 states and 406 transitions. [2018-06-26 18:13:46,326 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:13:46,326 INFO ]: Found error trace [2018-06-26 18:13:46,326 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-26 18:13:46,326 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:46,326 INFO ]: Analyzing trace with hash -266646725, now seen corresponding path program 9 times [2018-06-26 18:13:46,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:46,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:46,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:46,327 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:46,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:46,344 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:46,737 WARN ]: Spent 165.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 8 [2018-06-26 18:13:47,117 WARN ]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2018-06-26 18:13:47,459 WARN ]: Spent 214.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2018-06-26 18:13:47,929 WARN ]: Spent 407.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 59 [2018-06-26 18:13:48,464 WARN ]: Spent 430.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2018-06-26 18:13:48,954 WARN ]: Spent 403.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 61 [2018-06-26 18:13:48,956 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:48,956 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:48,956 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:13:48,962 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:13:49,038 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 18:13:49,038 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:49,042 INFO ]: Computing forward predicates... [2018-06-26 18:13:49,289 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:49,308 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:49,308 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-26 18:13:49,308 INFO ]: Interpolant automaton has 22 states [2018-06-26 18:13:49,308 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 18:13:49,308 INFO ]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:13:49,309 INFO ]: Start difference. First operand 159 states and 406 transitions. Second operand 22 states. [2018-06-26 18:13:49,449 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:49,449 INFO ]: Finished difference Result 179 states and 464 transitions. [2018-06-26 18:13:49,449 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 18:13:49,449 INFO ]: Start accepts. Automaton has 22 states. Word has length 14 [2018-06-26 18:13:49,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:49,451 INFO ]: With dead ends: 179 [2018-06-26 18:13:49,451 INFO ]: Without dead ends: 179 [2018-06-26 18:13:49,452 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:13:49,452 INFO ]: Start minimizeSevpa. Operand 179 states. [2018-06-26 18:13:49,458 INFO ]: Finished minimizeSevpa. Reduced states from 179 to 164. [2018-06-26 18:13:49,458 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-26 18:13:49,460 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 421 transitions. [2018-06-26 18:13:49,460 INFO ]: Start accepts. Automaton has 164 states and 421 transitions. Word has length 14 [2018-06-26 18:13:49,460 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:49,460 INFO ]: Abstraction has 164 states and 421 transitions. [2018-06-26 18:13:49,460 INFO ]: Interpolant automaton has 22 states. [2018-06-26 18:13:49,460 INFO ]: Start isEmpty. Operand 164 states and 421 transitions. [2018-06-26 18:13:49,461 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:13:49,461 INFO ]: Found error trace [2018-06-26 18:13:49,461 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:13:49,461 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:49,461 INFO ]: Analyzing trace with hash 1352076318, now seen corresponding path program 6 times [2018-06-26 18:13:49,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:49,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:49,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:49,462 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:49,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:49,484 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:49,767 WARN ]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-26 18:13:50,378 INFO ]: Checked inductivity of 45 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:50,378 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:50,378 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:13:50,383 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:13:50,455 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-26 18:13:50,455 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:50,460 INFO ]: Computing forward predicates... [2018-06-26 18:13:50,946 INFO ]: Checked inductivity of 45 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:13:50,966 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:50,967 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-26 18:13:50,967 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:13:50,967 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:13:50,967 INFO ]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:13:50,967 INFO ]: Start difference. First operand 164 states and 421 transitions. Second operand 20 states. [2018-06-26 18:13:57,574 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:57,574 INFO ]: Finished difference Result 790 states and 2020 transitions. [2018-06-26 18:13:57,575 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-06-26 18:13:57,575 INFO ]: Start accepts. Automaton has 20 states. Word has length 14 [2018-06-26 18:13:57,575 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:57,580 INFO ]: With dead ends: 790 [2018-06-26 18:13:57,580 INFO ]: Without dead ends: 790 [2018-06-26 18:13:57,583 INFO ]: 0 DeclaredPredicates, 125 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5156 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1912, Invalid=12368, Unknown=0, NotChecked=0, Total=14280 [2018-06-26 18:13:57,584 INFO ]: Start minimizeSevpa. Operand 790 states. [2018-06-26 18:13:57,604 INFO ]: Finished minimizeSevpa. Reduced states from 790 to 356. [2018-06-26 18:13:57,604 INFO ]: Start removeUnreachable. Operand 356 states. [2018-06-26 18:13:57,607 INFO ]: Finished removeUnreachable. Reduced from 356 states to 356 states and 937 transitions. [2018-06-26 18:13:57,607 INFO ]: Start accepts. Automaton has 356 states and 937 transitions. Word has length 14 [2018-06-26 18:13:57,607 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:57,607 INFO ]: Abstraction has 356 states and 937 transitions. [2018-06-26 18:13:57,607 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:13:57,607 INFO ]: Start isEmpty. Operand 356 states and 937 transitions. [2018-06-26 18:13:57,609 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:13:57,609 INFO ]: Found error trace [2018-06-26 18:13:57,609 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:13:57,609 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:57,609 INFO ]: Analyzing trace with hash -2055417088, now seen corresponding path program 7 times [2018-06-26 18:13:57,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:57,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:57,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:57,610 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:13:57,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:57,623 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:57,963 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2018-06-26 18:13:58,037 INFO ]: Checked inductivity of 45 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:13:58,037 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:58,037 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:13:58,043 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:58,111 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:58,116 INFO ]: Computing forward predicates... [2018-06-26 18:13:58,226 INFO ]: Checked inductivity of 45 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:13:58,245 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:58,245 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-26 18:13:58,246 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:13:58,246 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:13:58,246 INFO ]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:13:58,246 INFO ]: Start difference. First operand 356 states and 937 transitions. Second operand 11 states. [2018-06-26 18:13:58,488 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:13:58,488 INFO ]: Finished difference Result 522 states and 1372 transitions. [2018-06-26 18:13:58,490 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:13:58,490 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-26 18:13:58,490 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:13:58,492 INFO ]: With dead ends: 522 [2018-06-26 18:13:58,492 INFO ]: Without dead ends: 370 [2018-06-26 18:13:58,493 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:13:58,493 INFO ]: Start minimizeSevpa. Operand 370 states. [2018-06-26 18:13:58,502 INFO ]: Finished minimizeSevpa. Reduced states from 370 to 370. [2018-06-26 18:13:58,502 INFO ]: Start removeUnreachable. Operand 370 states. [2018-06-26 18:13:58,504 INFO ]: Finished removeUnreachable. Reduced from 370 states to 370 states and 950 transitions. [2018-06-26 18:13:58,505 INFO ]: Start accepts. Automaton has 370 states and 950 transitions. Word has length 14 [2018-06-26 18:13:58,505 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:13:58,505 INFO ]: Abstraction has 370 states and 950 transitions. [2018-06-26 18:13:58,505 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:13:58,507 INFO ]: Start isEmpty. Operand 370 states and 950 transitions. [2018-06-26 18:13:58,508 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:13:58,508 INFO ]: Found error trace [2018-06-26 18:13:58,508 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-06-26 18:13:58,508 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:13:58,509 INFO ]: Analyzing trace with hash -583595642, now seen corresponding path program 5 times [2018-06-26 18:13:58,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:13:58,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:13:58,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:58,509 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:13:58,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:13:58,522 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:58,723 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-26 18:13:58,887 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-26 18:13:59,420 INFO ]: Checked inductivity of 45 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:59,420 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:13:59,420 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:13:59,432 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:13:59,487 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-26 18:13:59,487 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:13:59,492 INFO ]: Computing forward predicates... [2018-06-26 18:13:59,714 INFO ]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:13:59,733 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:13:59,733 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-06-26 18:13:59,734 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:13:59,734 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:13:59,734 INFO ]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:13:59,734 INFO ]: Start difference. First operand 370 states and 950 transitions. Second operand 16 states. [2018-06-26 18:14:00,192 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:00,192 INFO ]: Finished difference Result 595 states and 1524 transitions. [2018-06-26 18:14:00,192 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 18:14:00,192 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-26 18:14:00,193 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:00,196 INFO ]: With dead ends: 595 [2018-06-26 18:14:00,196 INFO ]: Without dead ends: 595 [2018-06-26 18:14:00,197 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:14:00,197 INFO ]: Start minimizeSevpa. Operand 595 states. [2018-06-26 18:14:00,212 INFO ]: Finished minimizeSevpa. Reduced states from 595 to 443. [2018-06-26 18:14:00,212 INFO ]: Start removeUnreachable. Operand 443 states. [2018-06-26 18:14:00,215 INFO ]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1128 transitions. [2018-06-26 18:14:00,215 INFO ]: Start accepts. Automaton has 443 states and 1128 transitions. Word has length 14 [2018-06-26 18:14:00,215 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:00,215 INFO ]: Abstraction has 443 states and 1128 transitions. [2018-06-26 18:14:00,215 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:14:00,215 INFO ]: Start isEmpty. Operand 443 states and 1128 transitions. [2018-06-26 18:14:00,216 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:14:00,216 INFO ]: Found error trace [2018-06-26 18:14:00,216 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-26 18:14:00,216 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:00,216 INFO ]: Analyzing trace with hash 323786280, now seen corresponding path program 10 times [2018-06-26 18:14:00,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:00,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:00,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:00,217 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:14:00,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:00,240 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:00,877 WARN ]: Spent 244.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2018-06-26 18:14:01,145 WARN ]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 31 [2018-06-26 18:14:01,515 WARN ]: Spent 240.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 43 [2018-06-26 18:14:02,376 WARN ]: Spent 696.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 50 [2018-06-26 18:14:03,038 WARN ]: Spent 562.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 61 [2018-06-26 18:14:03,822 WARN ]: Spent 675.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 73 [2018-06-26 18:14:04,479 WARN ]: Spent 560.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 72 [2018-06-26 18:14:04,481 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:14:04,481 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:04,481 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:14:04,487 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:14:04,544 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:14:04,544 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:04,549 INFO ]: Computing forward predicates... [2018-06-26 18:14:04,826 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:14:04,845 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:14:04,845 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-26 18:14:04,845 INFO ]: Interpolant automaton has 24 states [2018-06-26 18:14:04,845 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 18:14:04,845 INFO ]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:14:04,845 INFO ]: Start difference. First operand 443 states and 1128 transitions. Second operand 24 states. [2018-06-26 18:14:04,961 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:04,961 INFO ]: Finished difference Result 497 states and 1290 transitions. [2018-06-26 18:14:04,961 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:14:04,961 INFO ]: Start accepts. Automaton has 24 states. Word has length 15 [2018-06-26 18:14:04,961 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:04,964 INFO ]: With dead ends: 497 [2018-06-26 18:14:04,964 INFO ]: Without dead ends: 497 [2018-06-26 18:14:04,964 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:14:04,964 INFO ]: Start minimizeSevpa. Operand 497 states. [2018-06-26 18:14:04,976 INFO ]: Finished minimizeSevpa. Reduced states from 497 to 449. [2018-06-26 18:14:04,976 INFO ]: Start removeUnreachable. Operand 449 states. [2018-06-26 18:14:04,978 INFO ]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1146 transitions. [2018-06-26 18:14:04,978 INFO ]: Start accepts. Automaton has 449 states and 1146 transitions. Word has length 15 [2018-06-26 18:14:04,978 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:04,978 INFO ]: Abstraction has 449 states and 1146 transitions. [2018-06-26 18:14:04,978 INFO ]: Interpolant automaton has 24 states. [2018-06-26 18:14:04,978 INFO ]: Start isEmpty. Operand 449 states and 1146 transitions. [2018-06-26 18:14:04,979 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:14:04,979 INFO ]: Found error trace [2018-06-26 18:14:04,980 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:14:04,980 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:04,982 INFO ]: Analyzing trace with hash -1464984083, now seen corresponding path program 8 times [2018-06-26 18:14:04,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:04,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:04,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:04,983 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:14:04,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:04,993 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:05,225 INFO ]: Checked inductivity of 55 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:14:05,225 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:05,225 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:14:05,231 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:14:05,281 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:14:05,282 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:05,284 INFO ]: Computing forward predicates... [2018-06-26 18:14:05,384 INFO ]: Checked inductivity of 55 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:14:05,403 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:14:05,403 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-26 18:14:05,403 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:14:05,403 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:14:05,403 INFO ]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:14:05,403 INFO ]: Start difference. First operand 449 states and 1146 transitions. Second operand 17 states. [2018-06-26 18:14:05,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:05,641 INFO ]: Finished difference Result 894 states and 2069 transitions. [2018-06-26 18:14:05,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 18:14:05,645 INFO ]: Start accepts. Automaton has 17 states. Word has length 15 [2018-06-26 18:14:05,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:05,649 INFO ]: With dead ends: 894 [2018-06-26 18:14:05,649 INFO ]: Without dead ends: 894 [2018-06-26 18:14:05,650 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2018-06-26 18:14:05,650 INFO ]: Start minimizeSevpa. Operand 894 states. [2018-06-26 18:14:05,667 INFO ]: Finished minimizeSevpa. Reduced states from 894 to 429. [2018-06-26 18:14:05,667 INFO ]: Start removeUnreachable. Operand 429 states. [2018-06-26 18:14:05,669 INFO ]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1022 transitions. [2018-06-26 18:14:05,669 INFO ]: Start accepts. Automaton has 429 states and 1022 transitions. Word has length 15 [2018-06-26 18:14:05,669 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:05,669 INFO ]: Abstraction has 429 states and 1022 transitions. [2018-06-26 18:14:05,669 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:14:05,669 INFO ]: Start isEmpty. Operand 429 states and 1022 transitions. [2018-06-26 18:14:05,670 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:14:05,670 INFO ]: Found error trace [2018-06-26 18:14:05,670 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-26 18:14:05,670 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:05,670 INFO ]: Analyzing trace with hash 1447340251, now seen corresponding path program 11 times [2018-06-26 18:14:05,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:05,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:05,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:05,671 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:14:05,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:05,695 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:06,562 WARN ]: Spent 169.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 8 [2018-06-26 18:14:06,969 WARN ]: Spent 357.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2018-06-26 18:14:07,513 WARN ]: Spent 468.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2018-06-26 18:14:07,940 WARN ]: Spent 166.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 45 [2018-06-26 18:14:08,231 WARN ]: Spent 259.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2018-06-26 18:14:08,614 WARN ]: Spent 334.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 61 [2018-06-26 18:14:09,645 WARN ]: Spent 781.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 72 [2018-06-26 18:14:10,662 WARN ]: Spent 814.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 85 [2018-06-26 18:14:11,584 WARN ]: Spent 686.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 81 [2018-06-26 18:14:11,586 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:14:11,586 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:11,586 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:14:11,592 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:14:11,660 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 18:14:11,660 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:11,667 INFO ]: Computing forward predicates... [2018-06-26 18:14:11,948 WARN ]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-26 18:14:12,357 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:14:12,376 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:14:12,397 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-26 18:14:12,397 INFO ]: Interpolant automaton has 26 states [2018-06-26 18:14:12,397 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 18:14:12,397 INFO ]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-06-26 18:14:12,398 INFO ]: Start difference. First operand 429 states and 1022 transitions. Second operand 26 states. [2018-06-26 18:14:12,452 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:12,452 INFO ]: Finished difference Result 478 states and 1161 transitions. [2018-06-26 18:14:12,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:14:12,453 INFO ]: Start accepts. Automaton has 26 states. Word has length 16 [2018-06-26 18:14:12,453 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:12,455 INFO ]: With dead ends: 478 [2018-06-26 18:14:12,455 INFO ]: Without dead ends: 478 [2018-06-26 18:14:12,455 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-06-26 18:14:12,455 INFO ]: Start minimizeSevpa. Operand 478 states. [2018-06-26 18:14:12,469 INFO ]: Finished minimizeSevpa. Reduced states from 478 to 435. [2018-06-26 18:14:12,469 INFO ]: Start removeUnreachable. Operand 435 states. [2018-06-26 18:14:12,470 INFO ]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1040 transitions. [2018-06-26 18:14:12,470 INFO ]: Start accepts. Automaton has 435 states and 1040 transitions. Word has length 16 [2018-06-26 18:14:12,470 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:12,470 INFO ]: Abstraction has 435 states and 1040 transitions. [2018-06-26 18:14:12,470 INFO ]: Interpolant automaton has 26 states. [2018-06-26 18:14:12,470 INFO ]: Start isEmpty. Operand 435 states and 1040 transitions. [2018-06-26 18:14:12,471 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:14:12,471 INFO ]: Found error trace [2018-06-26 18:14:12,472 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:14:12,472 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:12,472 INFO ]: Analyzing trace with hash 87253302, now seen corresponding path program 9 times [2018-06-26 18:14:12,472 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:12,472 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:12,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:12,472 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:14:12,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:12,488 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:13,031 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2018-06-26 18:14:13,271 WARN ]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2018-06-26 18:14:13,430 WARN ]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2018-06-26 18:14:13,594 WARN ]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2018-06-26 18:14:13,595 INFO ]: Checked inductivity of 66 backedges. 14 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:14:13,595 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:14:13,595 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:14:13,601 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:14:13,673 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-26 18:14:13,673 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:13,678 INFO ]: Computing forward predicates... [2018-06-26 18:14:13,930 INFO ]: Checked inductivity of 66 backedges. 7 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:14:13,963 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:14:13,963 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-06-26 18:14:13,963 INFO ]: Interpolant automaton has 25 states [2018-06-26 18:14:13,963 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 18:14:13,963 INFO ]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-06-26 18:14:13,963 INFO ]: Start difference. First operand 435 states and 1040 transitions. Second operand 25 states. [2018-06-26 18:14:14,573 WARN ]: Spent 370.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-06-26 18:14:22,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:14:22,288 INFO ]: Finished difference Result 2932 states and 6875 transitions. [2018-06-26 18:14:22,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-06-26 18:14:22,288 INFO ]: Start accepts. Automaton has 25 states. Word has length 16 [2018-06-26 18:14:22,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:14:22,299 INFO ]: With dead ends: 2932 [2018-06-26 18:14:22,300 INFO ]: Without dead ends: 2932 [2018-06-26 18:14:22,306 INFO ]: 0 DeclaredPredicates, 166 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10027 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2401, Invalid=23681, Unknown=0, NotChecked=0, Total=26082 [2018-06-26 18:14:22,307 INFO ]: Start minimizeSevpa. Operand 2932 states. [2018-06-26 18:14:22,358 INFO ]: Finished minimizeSevpa. Reduced states from 2932 to 1132. [2018-06-26 18:14:22,359 INFO ]: Start removeUnreachable. Operand 1132 states. [2018-06-26 18:14:22,363 INFO ]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2748 transitions. [2018-06-26 18:14:22,363 INFO ]: Start accepts. Automaton has 1132 states and 2748 transitions. Word has length 16 [2018-06-26 18:14:22,363 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:14:22,363 INFO ]: Abstraction has 1132 states and 2748 transitions. [2018-06-26 18:14:22,363 INFO ]: Interpolant automaton has 25 states. [2018-06-26 18:14:22,363 INFO ]: Start isEmpty. Operand 1132 states and 2748 transitions. [2018-06-26 18:14:22,366 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:14:22,366 INFO ]: Found error trace [2018-06-26 18:14:22,366 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-06-26 18:14:22,366 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:14:22,366 INFO ]: Analyzing trace with hash 1798444737, now seen corresponding path program 6 times [2018-06-26 18:14:22,366 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:14:22,366 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:14:22,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:22,366 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:14:22,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:14:22,384 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:14:22,844 WARN ]: Spent 341.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 Received shutdown request... [2018-06-26 18:14:22,931 WARN ]: Removed 3 from assertion stack [2018-06-26 18:14:22,932 WARN ]: Verification canceled [2018-06-26 18:14:22,934 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:14:22,935 WARN ]: Timeout [2018-06-26 18:14:22,935 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:14:22 BasicIcfg [2018-06-26 18:14:22,935 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:14:22,936 INFO ]: Toolchain (without parser) took 59285.82 ms. Allocated memory was 308.8 MB in the beginning and 1.1 GB in the end (delta: 779.1 MB). Free memory was 263.3 MB in the beginning and 500.1 MB in the end (delta: -236.8 MB). Peak memory consumption was 542.3 MB. Max. memory is 3.6 GB. [2018-06-26 18:14:22,937 INFO ]: SmtParser took 0.04 ms. Allocated memory is still 308.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:14:22,937 INFO ]: ChcToBoogie took 58.13 ms. Allocated memory is still 308.8 MB. Free memory was 263.3 MB in the beginning and 261.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:14:22,937 INFO ]: Boogie Preprocessor took 34.58 ms. Allocated memory is still 308.8 MB. Free memory was 261.3 MB in the beginning and 259.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:14:22,938 INFO ]: RCFGBuilder took 291.83 ms. Allocated memory is still 308.8 MB. Free memory was 259.3 MB in the beginning and 249.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:14:22,938 INFO ]: BlockEncodingV2 took 280.86 ms. Allocated memory is still 308.8 MB. Free memory was 249.4 MB in the beginning and 235.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:14:22,938 INFO ]: TraceAbstraction took 58612.60 ms. Allocated memory was 308.8 MB in the beginning and 1.1 GB in the end (delta: 779.1 MB). Free memory was 235.4 MB in the beginning and 500.1 MB in the end (delta: -264.7 MB). Peak memory consumption was 514.4 MB. Max. memory is 3.6 GB. [2018-06-26 18:14:22,943 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 16 locations, 18 edges - StatisticsResult: Encoded RCFG 6 locations, 9 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.04 ms. Allocated memory is still 308.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.13 ms. Allocated memory is still 308.8 MB. Free memory was 263.3 MB in the beginning and 261.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.58 ms. Allocated memory is still 308.8 MB. Free memory was 261.3 MB in the beginning and 259.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 291.83 ms. Allocated memory is still 308.8 MB. Free memory was 259.3 MB in the beginning and 249.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 280.86 ms. Allocated memory is still 308.8 MB. Free memory was 249.4 MB in the beginning and 235.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58612.60 ms. Allocated memory was 308.8 MB in the beginning and 1.1 GB in the end (delta: 779.1 MB). Free memory was 235.4 MB in the beginning and 500.1 MB in the end (delta: -264.7 MB). Peak memory consumption was 514.4 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 analyzing trace of length 17 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 11. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 58.5s OverallTime, 29 OverallIterations, 11 TraceHistogramMax, 19.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 157 SDtfs, 96 SDslu, 675 SDs, 0 SdLazy, 3513 SolverSat, 525 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 804 GetRequests, 177 SyntacticMatches, 13 SemanticMatches, 614 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17185 ImplicationChecksByTransitivity, 46.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132occurred in iteration=28, 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.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 3058 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 35.6s InterpolantComputationTime, 579 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 106 NumberOfCheckSat, 526 ConstructedInterpolants, 0 QuantifiedInterpolants, 131202 SizeOfPredicates, 1013 NumberOfNonLiveVariables, 9781 ConjunctsInSsa, 2151 ConjunctsInUnsatCore, 53 InterpolantComputations, 3 PerfectInterpolantSequences, 180/1350 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/array_fill2_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-14-22-955.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_fill2_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-14-22-955.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_fill2_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-14-22-955.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array_fill2_abstracted.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-14-22-955.csv Completed graceful shutdown