java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/termination/Ackermann06.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:28:30,389 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:28:30,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:28:30,403 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:28:30,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:28:30,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:28:30,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:28:30,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:28:30,408 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:28:30,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:28:30,410 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:28:30,410 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:28:30,411 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:28:30,412 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:28:30,413 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:28:30,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:28:30,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:28:30,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:28:30,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:28:30,419 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:28:30,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:28:30,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:28:30,424 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:28:30,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:28:30,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:28:30,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:28:30,426 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:28:30,427 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:28:30,427 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:28:30,428 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:28:30,429 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:28:30,429 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:28:30,430 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:28:30,430 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:28:30,431 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:28:30,431 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:28:30,432 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:28:30,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:28:30,449 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:28:30,449 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:28:30,449 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:28:30,450 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:28:30,450 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:28:30,451 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:28:30,451 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:28:30,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:28:30,451 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:28:30,451 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:28:30,452 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:28:30,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:28:30,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:28:30,452 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:28:30,453 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:28:30,453 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:28:30,453 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:28:30,453 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:28:30,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:28:30,454 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:28:30,455 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:28:30,455 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:28:30,497 INFO ]: Repository-Root is: /tmp [2018-06-26 18:28:30,512 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:28:30,517 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:28:30,518 INFO ]: Initializing SmtParser... [2018-06-26 18:28:30,518 INFO ]: SmtParser initialized [2018-06-26 18:28:30,519 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/termination/Ackermann06.smt2 [2018-06-26 18:28:30,520 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:28:30,609 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/termination/Ackermann06.smt2 unknown [2018-06-26 18:28:31,226 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/termination/Ackermann06.smt2 [2018-06-26 18:28:31,231 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:28:31,237 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:28:31,238 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:28:31,238 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:28:31,238 INFO ]: ChcToBoogie initialized [2018-06-26 18:28:31,241 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:28:31" (1/1) ... [2018-06-26 18:28:31,331 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:28:31 Unit [2018-06-26 18:28:31,332 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:28:31,332 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:28:31,332 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:28:31,332 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:28:31,351 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:28:31" (1/1) ... [2018-06-26 18:28:31,351 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:28:31" (1/1) ... [2018-06-26 18:28:31,362 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:28:31" (1/1) ... [2018-06-26 18:28:31,362 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:28:31" (1/1) ... [2018-06-26 18:28:31,378 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:28:31" (1/1) ... [2018-06-26 18:28:31,381 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:28:31" (1/1) ... [2018-06-26 18:28:31,385 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:28:31" (1/1) ... [2018-06-26 18:28:31,390 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:28:31,391 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:28:31,391 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:28:31,391 INFO ]: RCFGBuilder initialized [2018-06-26 18:28:31,391 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:28:31" (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:28:31,402 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:28:31,402 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:28:31,402 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:28:31,402 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:28:31,402 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:28:31,402 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:28:32,482 INFO ]: Using library mode [2018-06-26 18:28:32,483 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:28:32 BoogieIcfgContainer [2018-06-26 18:28:32,483 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:28:32,483 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:28:32,483 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:28:32,484 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:28:32,485 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:28:32" (1/1) ... [2018-06-26 18:28:32,516 INFO ]: Initial Icfg 48 locations, 77 edges [2018-06-26 18:28:32,518 INFO ]: Using Remove infeasible edges [2018-06-26 18:28:32,518 INFO ]: Using Maximize final states [2018-06-26 18:28:32,519 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:28:32,519 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:28:32,520 INFO ]: Using Remove sink states [2018-06-26 18:28:32,521 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:28:32,521 INFO ]: Using Use SBE [2018-06-26 18:28:32,528 WARN ]: expecting exponential blowup for input size 9 [2018-06-26 18:28:32,665 WARN ]: expecting exponential blowup for input size 9 [2018-06-26 18:28:32,807 WARN ]: expecting exponential blowup for input size 9 [2018-06-26 18:28:32,961 WARN ]: expecting exponential blowup for input size 9 [2018-06-26 18:28:33,060 WARN ]: expecting exponential blowup for input size 9 [2018-06-26 18:28:33,184 INFO ]: SBE split 5 edges [2018-06-26 18:28:33,191 INFO ]: Removed 4 edges and 2 locations because of local infeasibility [2018-06-26 18:28:33,194 INFO ]: 0 new accepting states [2018-06-26 18:28:35,999 INFO ]: Removed 201 edges and 13 locations by large block encoding [2018-06-26 18:28:36,001 INFO ]: Removed 4 edges and 3 locations by removing sink states [2018-06-26 18:28:36,002 INFO ]: Removed 54 edges and 0 locations because of local infeasibility [2018-06-26 18:28:36,002 INFO ]: 0 new accepting states [2018-06-26 18:28:36,003 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:28:36,003 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:28:36,004 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:28:36,004 INFO ]: 0 new accepting states [2018-06-26 18:28:36,004 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:28:36,005 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:28:36,005 INFO ]: Encoded RCFG 30 locations, 103 edges [2018-06-26 18:28:36,005 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:28:36 BasicIcfg [2018-06-26 18:28:36,005 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:28:36,007 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:28:36,007 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:28:36,010 INFO ]: TraceAbstraction initialized [2018-06-26 18:28:36,010 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:28:31" (1/4) ... [2018-06-26 18:28:36,011 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513e8c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:28:36, skipping insertion in model container [2018-06-26 18:28:36,011 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:28:31" (2/4) ... [2018-06-26 18:28:36,011 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513e8c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:28:36, skipping insertion in model container [2018-06-26 18:28:36,011 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:28:32" (3/4) ... [2018-06-26 18:28:36,011 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513e8c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:28:36, skipping insertion in model container [2018-06-26 18:28:36,012 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:28:36" (4/4) ... [2018-06-26 18:28:36,013 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:28:36,022 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:28:36,030 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:28:36,073 INFO ]: Using default assertion order modulation [2018-06-26 18:28:36,073 INFO ]: Interprodecural is true [2018-06-26 18:28:36,073 INFO ]: Hoare is false [2018-06-26 18:28:36,073 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:28:36,073 INFO ]: Backedges is TWOTRACK [2018-06-26 18:28:36,074 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:28:36,074 INFO ]: Difference is false [2018-06-26 18:28:36,074 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:28:36,074 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:28:36,087 INFO ]: Start isEmpty. Operand 30 states. [2018-06-26 18:28:36,099 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:28:36,099 INFO ]: Found error trace [2018-06-26 18:28:36,100 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:28:36,100 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:36,105 INFO ]: Analyzing trace with hash 50485476, now seen corresponding path program 1 times [2018-06-26 18:28:36,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:36,108 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:36,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:36,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:36,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:36,236 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:36,431 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:28:36,434 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:28:36,434 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:28:36,436 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:28:36,451 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:28:36,452 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:28:36,455 INFO ]: Start difference. First operand 30 states. Second operand 3 states. [2018-06-26 18:28:36,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:36,837 INFO ]: Finished difference Result 35 states and 108 transitions. [2018-06-26 18:28:36,843 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:28:36,844 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:28:36,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:36,866 INFO ]: With dead ends: 35 [2018-06-26 18:28:36,866 INFO ]: Without dead ends: 29 [2018-06-26 18:28:36,876 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:28:36,889 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 18:28:36,913 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-26 18:28:36,914 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 18:28:36,915 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2018-06-26 18:28:36,916 INFO ]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 5 [2018-06-26 18:28:36,917 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:36,917 INFO ]: Abstraction has 25 states and 52 transitions. [2018-06-26 18:28:36,917 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:28:36,917 INFO ]: Start isEmpty. Operand 25 states and 52 transitions. [2018-06-26 18:28:36,919 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:28:36,919 INFO ]: Found error trace [2018-06-26 18:28:36,919 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:28:36,919 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:36,919 INFO ]: Analyzing trace with hash 49830074, now seen corresponding path program 1 times [2018-06-26 18:28:36,920 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:36,920 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:36,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:36,920 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:36,920 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:36,928 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:36,956 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:28:36,956 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:28:36,956 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:28:36,957 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:28:36,958 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:28:36,958 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:28:36,958 INFO ]: Start difference. First operand 25 states and 52 transitions. Second operand 3 states. [2018-06-26 18:28:37,088 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:37,088 INFO ]: Finished difference Result 33 states and 70 transitions. [2018-06-26 18:28:37,089 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:28:37,089 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:28:37,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:37,091 INFO ]: With dead ends: 33 [2018-06-26 18:28:37,091 INFO ]: Without dead ends: 33 [2018-06-26 18:28:37,092 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:28:37,092 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 18:28:37,098 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 18:28:37,098 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 18:28:37,100 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 70 transitions. [2018-06-26 18:28:37,100 INFO ]: Start accepts. Automaton has 33 states and 70 transitions. Word has length 5 [2018-06-26 18:28:37,100 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:37,100 INFO ]: Abstraction has 33 states and 70 transitions. [2018-06-26 18:28:37,100 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:28:37,100 INFO ]: Start isEmpty. Operand 33 states and 70 transitions. [2018-06-26 18:28:37,102 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:28:37,102 INFO ]: Found error trace [2018-06-26 18:28:37,102 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:28:37,102 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:37,102 INFO ]: Analyzing trace with hash 1556897182, now seen corresponding path program 1 times [2018-06-26 18:28:37,102 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:37,102 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:37,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:37,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:37,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:37,162 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:37,242 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:28:37,242 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:28:37,242 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:28:37,243 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:28:37,243 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:28:37,243 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:28:37,243 INFO ]: Start difference. First operand 33 states and 70 transitions. Second operand 3 states. [2018-06-26 18:28:37,274 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:37,274 INFO ]: Finished difference Result 45 states and 94 transitions. [2018-06-26 18:28:37,274 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:28:37,274 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:28:37,274 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:37,276 INFO ]: With dead ends: 45 [2018-06-26 18:28:37,276 INFO ]: Without dead ends: 45 [2018-06-26 18:28:37,276 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:28:37,277 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-26 18:28:37,286 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 35. [2018-06-26 18:28:37,288 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 18:28:37,289 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 76 transitions. [2018-06-26 18:28:37,289 INFO ]: Start accepts. Automaton has 35 states and 76 transitions. Word has length 6 [2018-06-26 18:28:37,289 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:37,289 INFO ]: Abstraction has 35 states and 76 transitions. [2018-06-26 18:28:37,289 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:28:37,289 INFO ]: Start isEmpty. Operand 35 states and 76 transitions. [2018-06-26 18:28:37,291 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:28:37,291 INFO ]: Found error trace [2018-06-26 18:28:37,291 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:28:37,291 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:37,291 INFO ]: Analyzing trace with hash 1553203098, now seen corresponding path program 1 times [2018-06-26 18:28:37,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:37,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:37,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:37,293 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:37,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:37,305 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:37,347 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:28:37,348 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:28:37,369 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:28:37,370 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:28:37,370 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:28:37,370 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:28:37,370 INFO ]: Start difference. First operand 35 states and 76 transitions. Second operand 3 states. [2018-06-26 18:28:37,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:37,407 INFO ]: Finished difference Result 41 states and 86 transitions. [2018-06-26 18:28:37,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:28:37,407 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:28:37,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:37,440 INFO ]: With dead ends: 41 [2018-06-26 18:28:37,440 INFO ]: Without dead ends: 34 [2018-06-26 18:28:37,443 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:28:37,443 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 18:28:37,449 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 18:28:37,449 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:28:37,450 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 72 transitions. [2018-06-26 18:28:37,450 INFO ]: Start accepts. Automaton has 34 states and 72 transitions. Word has length 6 [2018-06-26 18:28:37,450 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:37,450 INFO ]: Abstraction has 34 states and 72 transitions. [2018-06-26 18:28:37,450 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:28:37,450 INFO ]: Start isEmpty. Operand 34 states and 72 transitions. [2018-06-26 18:28:37,453 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:28:37,453 INFO ]: Found error trace [2018-06-26 18:28:37,453 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:37,453 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:37,454 INFO ]: Analyzing trace with hash 97642160, now seen corresponding path program 1 times [2018-06-26 18:28:37,454 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:37,454 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:37,455 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:37,455 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:37,455 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:37,480 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:37,571 INFO ]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:28:37,571 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:28:37,571 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:28:37,571 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:28:37,571 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:28:37,571 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:28:37,571 INFO ]: Start difference. First operand 34 states and 72 transitions. Second operand 3 states. [2018-06-26 18:28:37,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:37,661 INFO ]: Finished difference Result 42 states and 84 transitions. [2018-06-26 18:28:37,661 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:28:37,661 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 18:28:37,661 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:37,662 INFO ]: With dead ends: 42 [2018-06-26 18:28:37,662 INFO ]: Without dead ends: 42 [2018-06-26 18:28:37,663 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:28:37,663 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-26 18:28:37,670 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-26 18:28:37,670 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-26 18:28:37,672 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 84 transitions. [2018-06-26 18:28:37,672 INFO ]: Start accepts. Automaton has 42 states and 84 transitions. Word has length 11 [2018-06-26 18:28:37,672 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:37,672 INFO ]: Abstraction has 42 states and 84 transitions. [2018-06-26 18:28:37,672 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:28:37,672 INFO ]: Start isEmpty. Operand 42 states and 84 transitions. [2018-06-26 18:28:37,679 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:28:37,679 INFO ]: Found error trace [2018-06-26 18:28:37,679 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:37,679 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:37,679 INFO ]: Analyzing trace with hash -391935274, now seen corresponding path program 1 times [2018-06-26 18:28:37,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:37,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:37,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:37,680 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:37,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:37,707 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:37,795 INFO ]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:28:37,796 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:28:37,796 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:28:37,805 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:37,900 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:37,910 INFO ]: Computing forward predicates... [2018-06-26 18:28:38,173 INFO ]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:28:38,206 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:28:38,206 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 18:28:38,207 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:28:38,207 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:28:38,207 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:28:38,207 INFO ]: Start difference. First operand 42 states and 84 transitions. Second operand 8 states. [2018-06-26 18:28:38,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:38,629 INFO ]: Finished difference Result 69 states and 143 transitions. [2018-06-26 18:28:38,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:28:38,629 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-26 18:28:38,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:38,633 INFO ]: With dead ends: 69 [2018-06-26 18:28:38,633 INFO ]: Without dead ends: 69 [2018-06-26 18:28:38,633 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:28:38,633 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-26 18:28:38,648 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-06-26 18:28:38,648 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-26 18:28:38,651 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 135 transitions. [2018-06-26 18:28:38,651 INFO ]: Start accepts. Automaton has 61 states and 135 transitions. Word has length 13 [2018-06-26 18:28:38,651 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:38,651 INFO ]: Abstraction has 61 states and 135 transitions. [2018-06-26 18:28:38,651 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:28:38,651 INFO ]: Start isEmpty. Operand 61 states and 135 transitions. [2018-06-26 18:28:38,655 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:28:38,655 INFO ]: Found error trace [2018-06-26 18:28:38,655 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:38,655 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:38,655 INFO ]: Analyzing trace with hash -1545456240, now seen corresponding path program 2 times [2018-06-26 18:28:38,655 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:38,655 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:38,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:38,656 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:38,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:38,701 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:38,822 INFO ]: Checked inductivity of 12 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:28:38,822 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:28:38,822 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:28:38,834 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:28:38,928 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:28:38,928 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:38,932 INFO ]: Computing forward predicates... [2018-06-26 18:28:38,970 INFO ]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:28:38,998 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:28:38,998 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2018-06-26 18:28:38,998 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:28:38,998 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:28:38,998 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:28:38,998 INFO ]: Start difference. First operand 61 states and 135 transitions. Second operand 8 states. [2018-06-26 18:28:39,421 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:39,421 INFO ]: Finished difference Result 81 states and 171 transitions. [2018-06-26 18:28:39,422 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:28:39,422 INFO ]: Start accepts. Automaton has 8 states. Word has length 14 [2018-06-26 18:28:39,422 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:39,426 INFO ]: With dead ends: 81 [2018-06-26 18:28:39,426 INFO ]: Without dead ends: 81 [2018-06-26 18:28:39,427 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:28:39,427 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-26 18:28:39,442 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 63. [2018-06-26 18:28:39,442 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-26 18:28:39,444 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 141 transitions. [2018-06-26 18:28:39,444 INFO ]: Start accepts. Automaton has 63 states and 141 transitions. Word has length 14 [2018-06-26 18:28:39,444 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:39,444 INFO ]: Abstraction has 63 states and 141 transitions. [2018-06-26 18:28:39,444 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:28:39,444 INFO ]: Start isEmpty. Operand 63 states and 141 transitions. [2018-06-26 18:28:39,447 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:28:39,447 INFO ]: Found error trace [2018-06-26 18:28:39,448 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:39,448 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:39,448 INFO ]: Analyzing trace with hash -1911017375, now seen corresponding path program 1 times [2018-06-26 18:28:39,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:39,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:39,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:39,448 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:28:39,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:39,468 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:39,548 INFO ]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:28:39,549 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:28:39,549 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:28:39,549 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:28:39,549 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:28:39,549 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:28:39,549 INFO ]: Start difference. First operand 63 states and 141 transitions. Second operand 3 states. [2018-06-26 18:28:39,743 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:39,743 INFO ]: Finished difference Result 75 states and 159 transitions. [2018-06-26 18:28:39,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:28:39,743 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 18:28:39,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:39,745 INFO ]: With dead ends: 75 [2018-06-26 18:28:39,745 INFO ]: Without dead ends: 75 [2018-06-26 18:28:39,745 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:28:39,745 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-26 18:28:39,760 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-06-26 18:28:39,760 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-26 18:28:39,761 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 149 transitions. [2018-06-26 18:28:39,761 INFO ]: Start accepts. Automaton has 70 states and 149 transitions. Word has length 14 [2018-06-26 18:28:39,761 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:39,761 INFO ]: Abstraction has 70 states and 149 transitions. [2018-06-26 18:28:39,761 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:28:39,761 INFO ]: Start isEmpty. Operand 70 states and 149 transitions. [2018-06-26 18:28:39,763 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:28:39,763 INFO ]: Found error trace [2018-06-26 18:28:39,763 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:39,764 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:39,764 INFO ]: Analyzing trace with hash -672655758, now seen corresponding path program 3 times [2018-06-26 18:28:39,764 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:39,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:39,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:39,764 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:39,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:39,798 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:39,961 INFO ]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:28:39,961 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:28:39,961 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:28:39,967 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:28:40,093 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:28:40,093 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:40,097 INFO ]: Computing forward predicates... [2018-06-26 18:28:40,345 INFO ]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:28:40,377 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:28:40,377 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-06-26 18:28:40,377 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:28:40,377 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:28:40,377 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:28:40,377 INFO ]: Start difference. First operand 70 states and 149 transitions. Second operand 7 states. [2018-06-26 18:28:40,966 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:40,966 INFO ]: Finished difference Result 118 states and 250 transitions. [2018-06-26 18:28:40,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:28:40,966 INFO ]: Start accepts. Automaton has 7 states. Word has length 15 [2018-06-26 18:28:40,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:40,968 INFO ]: With dead ends: 118 [2018-06-26 18:28:40,968 INFO ]: Without dead ends: 105 [2018-06-26 18:28:40,968 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:28:40,968 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-26 18:28:40,982 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 67. [2018-06-26 18:28:40,982 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-26 18:28:40,983 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 139 transitions. [2018-06-26 18:28:40,984 INFO ]: Start accepts. Automaton has 67 states and 139 transitions. Word has length 15 [2018-06-26 18:28:40,984 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:40,984 INFO ]: Abstraction has 67 states and 139 transitions. [2018-06-26 18:28:40,984 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:28:40,984 INFO ]: Start isEmpty. Operand 67 states and 139 transitions. [2018-06-26 18:28:40,986 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 18:28:40,986 INFO ]: Found error trace [2018-06-26 18:28:40,986 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:40,986 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:40,986 INFO ]: Analyzing trace with hash 1829097741, now seen corresponding path program 1 times [2018-06-26 18:28:40,986 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:40,986 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:40,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:40,987 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:28:40,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:41,009 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:41,131 INFO ]: Checked inductivity of 27 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 18:28:41,131 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:28:41,131 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:28:41,140 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:41,224 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:41,228 INFO ]: Computing forward predicates... [2018-06-26 18:28:41,391 INFO ]: Checked inductivity of 27 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 18:28:41,420 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:28:41,420 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-26 18:28:41,421 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:28:41,421 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:28:41,421 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:28:41,421 INFO ]: Start difference. First operand 67 states and 139 transitions. Second operand 13 states. [2018-06-26 18:28:42,363 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:42,363 INFO ]: Finished difference Result 138 states and 310 transitions. [2018-06-26 18:28:42,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:28:42,381 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-26 18:28:42,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:42,384 INFO ]: With dead ends: 138 [2018-06-26 18:28:42,384 INFO ]: Without dead ends: 138 [2018-06-26 18:28:42,385 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:28:42,385 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-26 18:28:42,398 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 78. [2018-06-26 18:28:42,398 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-26 18:28:42,400 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 166 transitions. [2018-06-26 18:28:42,400 INFO ]: Start accepts. Automaton has 78 states and 166 transitions. Word has length 21 [2018-06-26 18:28:42,400 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:42,400 INFO ]: Abstraction has 78 states and 166 transitions. [2018-06-26 18:28:42,400 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:28:42,400 INFO ]: Start isEmpty. Operand 78 states and 166 transitions. [2018-06-26 18:28:42,403 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 18:28:42,403 INFO ]: Found error trace [2018-06-26 18:28:42,403 INFO ]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:42,403 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:42,403 INFO ]: Analyzing trace with hash 141336692, now seen corresponding path program 1 times [2018-06-26 18:28:42,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:42,403 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:42,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:42,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:42,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:42,418 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:42,502 INFO ]: Checked inductivity of 66 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-26 18:28:42,502 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:28:42,502 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:28:42,502 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:28:42,503 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:28:42,503 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:28:42,503 INFO ]: Start difference. First operand 78 states and 166 transitions. Second operand 3 states. [2018-06-26 18:28:42,558 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:42,558 INFO ]: Finished difference Result 88 states and 186 transitions. [2018-06-26 18:28:42,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:28:42,558 INFO ]: Start accepts. Automaton has 3 states. Word has length 32 [2018-06-26 18:28:42,558 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:42,559 INFO ]: With dead ends: 88 [2018-06-26 18:28:42,559 INFO ]: Without dead ends: 88 [2018-06-26 18:28:42,560 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:28:42,560 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-26 18:28:42,567 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-06-26 18:28:42,567 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-26 18:28:42,568 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 186 transitions. [2018-06-26 18:28:42,569 INFO ]: Start accepts. Automaton has 88 states and 186 transitions. Word has length 32 [2018-06-26 18:28:42,569 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:42,569 INFO ]: Abstraction has 88 states and 186 transitions. [2018-06-26 18:28:42,569 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:28:42,569 INFO ]: Start isEmpty. Operand 88 states and 186 transitions. [2018-06-26 18:28:42,572 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-26 18:28:42,572 INFO ]: Found error trace [2018-06-26 18:28:42,572 INFO ]: trace histogram [7, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:42,572 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:42,573 INFO ]: Analyzing trace with hash 1259811134, now seen corresponding path program 1 times [2018-06-26 18:28:42,573 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:42,573 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:42,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:42,573 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:42,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:42,595 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:42,698 INFO ]: Checked inductivity of 122 backedges. 41 proven. 16 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-06-26 18:28:42,698 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:28:42,698 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:28:42,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:42,904 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:42,912 INFO ]: Computing forward predicates... [2018-06-26 18:28:42,942 INFO ]: Checked inductivity of 122 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-06-26 18:28:42,970 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:28:42,970 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-06-26 18:28:42,971 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:28:42,971 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:28:42,971 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:28:42,971 INFO ]: Start difference. First operand 88 states and 186 transitions. Second operand 10 states. [2018-06-26 18:28:44,798 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:44,798 INFO ]: Finished difference Result 221 states and 535 transitions. [2018-06-26 18:28:44,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 18:28:44,799 INFO ]: Start accepts. Automaton has 10 states. Word has length 44 [2018-06-26 18:28:44,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:44,803 INFO ]: With dead ends: 221 [2018-06-26 18:28:44,803 INFO ]: Without dead ends: 221 [2018-06-26 18:28:44,804 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:28:44,804 INFO ]: Start minimizeSevpa. Operand 221 states. [2018-06-26 18:28:44,824 INFO ]: Finished minimizeSevpa. Reduced states from 221 to 142. [2018-06-26 18:28:44,824 INFO ]: Start removeUnreachable. Operand 142 states. [2018-06-26 18:28:44,827 INFO ]: Finished removeUnreachable. Reduced from 142 states to 142 states and 300 transitions. [2018-06-26 18:28:44,827 INFO ]: Start accepts. Automaton has 142 states and 300 transitions. Word has length 44 [2018-06-26 18:28:44,827 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:44,827 INFO ]: Abstraction has 142 states and 300 transitions. [2018-06-26 18:28:44,827 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:28:44,827 INFO ]: Start isEmpty. Operand 142 states and 300 transitions. [2018-06-26 18:28:44,830 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-26 18:28:44,830 INFO ]: Found error trace [2018-06-26 18:28:44,830 INFO ]: trace histogram [7, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:44,830 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:44,831 INFO ]: Analyzing trace with hash 935362100, now seen corresponding path program 2 times [2018-06-26 18:28:44,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:44,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:44,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:44,831 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:44,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:44,876 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:45,917 INFO ]: Checked inductivity of 135 backedges. 80 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-26 18:28:45,917 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:28:45,917 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) [2018-06-26 18:28:45,932 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:28:46,097 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:28:46,097 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:46,287 INFO ]: Computing forward predicates... [2018-06-26 18:28:46,312 INFO ]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-26 18:28:46,333 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:28:46,333 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2018-06-26 18:28:46,333 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:28:46,334 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:28:46,334 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:28:46,334 INFO ]: Start difference. First operand 142 states and 300 transitions. Second operand 13 states. [2018-06-26 18:28:47,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:47,031 INFO ]: Finished difference Result 220 states and 525 transitions. [2018-06-26 18:28:47,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 18:28:47,031 INFO ]: Start accepts. Automaton has 13 states. Word has length 45 [2018-06-26 18:28:47,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:47,037 INFO ]: With dead ends: 220 [2018-06-26 18:28:47,037 INFO ]: Without dead ends: 220 [2018-06-26 18:28:47,037 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2018-06-26 18:28:47,037 INFO ]: Start minimizeSevpa. Operand 220 states. [2018-06-26 18:28:47,065 INFO ]: Finished minimizeSevpa. Reduced states from 220 to 142. [2018-06-26 18:28:47,065 INFO ]: Start removeUnreachable. Operand 142 states. [2018-06-26 18:28:47,068 INFO ]: Finished removeUnreachable. Reduced from 142 states to 142 states and 297 transitions. [2018-06-26 18:28:47,068 INFO ]: Start accepts. Automaton has 142 states and 297 transitions. Word has length 45 [2018-06-26 18:28:47,068 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:47,068 INFO ]: Abstraction has 142 states and 297 transitions. [2018-06-26 18:28:47,068 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:28:47,068 INFO ]: Start isEmpty. Operand 142 states and 297 transitions. [2018-06-26 18:28:47,073 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-26 18:28:47,073 INFO ]: Found error trace [2018-06-26 18:28:47,073 INFO ]: trace histogram [7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:47,073 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:47,073 INFO ]: Analyzing trace with hash 762895716, now seen corresponding path program 1 times [2018-06-26 18:28:47,073 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:47,073 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:47,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:47,074 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:28:47,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:47,125 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:47,420 INFO ]: Checked inductivity of 149 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-06-26 18:28:47,420 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:28:47,420 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:28:47,430 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:47,581 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:47,588 INFO ]: Computing forward predicates... [2018-06-26 18:28:47,707 INFO ]: Checked inductivity of 149 backedges. 71 proven. 27 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 18:28:47,727 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:28:47,727 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-06-26 18:28:47,727 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:28:47,727 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:28:47,727 INFO ]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:28:47,728 INFO ]: Start difference. First operand 142 states and 297 transitions. Second operand 17 states. [2018-06-26 18:28:48,571 WARN ]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-26 18:28:51,685 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:51,685 INFO ]: Finished difference Result 367 states and 1005 transitions. [2018-06-26 18:28:51,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-26 18:28:51,685 INFO ]: Start accepts. Automaton has 17 states. Word has length 46 [2018-06-26 18:28:51,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:51,695 INFO ]: With dead ends: 367 [2018-06-26 18:28:51,695 INFO ]: Without dead ends: 367 [2018-06-26 18:28:51,696 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=323, Invalid=2539, Unknown=0, NotChecked=0, Total=2862 [2018-06-26 18:28:51,696 INFO ]: Start minimizeSevpa. Operand 367 states. [2018-06-26 18:28:51,754 INFO ]: Finished minimizeSevpa. Reduced states from 367 to 247. [2018-06-26 18:28:51,754 INFO ]: Start removeUnreachable. Operand 247 states. [2018-06-26 18:28:51,762 INFO ]: Finished removeUnreachable. Reduced from 247 states to 247 states and 659 transitions. [2018-06-26 18:28:51,762 INFO ]: Start accepts. Automaton has 247 states and 659 transitions. Word has length 46 [2018-06-26 18:28:51,762 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:51,762 INFO ]: Abstraction has 247 states and 659 transitions. [2018-06-26 18:28:51,762 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:28:51,762 INFO ]: Start isEmpty. Operand 247 states and 659 transitions. [2018-06-26 18:28:51,771 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-26 18:28:51,771 INFO ]: Found error trace [2018-06-26 18:28:51,771 INFO ]: trace histogram [7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:51,771 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:51,771 INFO ]: Analyzing trace with hash -749997590, now seen corresponding path program 2 times [2018-06-26 18:28:51,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:51,772 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:51,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:51,772 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:51,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:51,816 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:52,126 INFO ]: Checked inductivity of 164 backedges. 43 proven. 56 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-06-26 18:28:52,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:28:52,126 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:28:52,133 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:28:52,300 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:28:52,300 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:52,306 INFO ]: Computing forward predicates... [2018-06-26 18:28:52,547 INFO ]: Checked inductivity of 164 backedges. 72 proven. 41 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 18:28:52,581 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:28:52,581 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-06-26 18:28:52,581 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:28:52,582 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:28:52,582 INFO ]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:28:52,582 INFO ]: Start difference. First operand 247 states and 659 transitions. Second operand 19 states. [2018-06-26 18:28:55,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:55,783 INFO ]: Finished difference Result 502 states and 1717 transitions. [2018-06-26 18:28:55,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-06-26 18:28:55,788 INFO ]: Start accepts. Automaton has 19 states. Word has length 47 [2018-06-26 18:28:55,788 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:55,806 INFO ]: With dead ends: 502 [2018-06-26 18:28:55,806 INFO ]: Without dead ends: 502 [2018-06-26 18:28:55,808 INFO ]: 0 DeclaredPredicates, 138 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1626 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=577, Invalid=5123, Unknown=0, NotChecked=0, Total=5700 [2018-06-26 18:28:55,810 INFO ]: Start minimizeSevpa. Operand 502 states. [2018-06-26 18:28:55,932 INFO ]: Finished minimizeSevpa. Reduced states from 502 to 270. [2018-06-26 18:28:55,932 INFO ]: Start removeUnreachable. Operand 270 states. [2018-06-26 18:28:55,939 INFO ]: Finished removeUnreachable. Reduced from 270 states to 270 states and 744 transitions. [2018-06-26 18:28:55,940 INFO ]: Start accepts. Automaton has 270 states and 744 transitions. Word has length 47 [2018-06-26 18:28:55,940 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:55,940 INFO ]: Abstraction has 270 states and 744 transitions. [2018-06-26 18:28:55,940 INFO ]: Interpolant automaton has 19 states. [2018-06-26 18:28:55,940 INFO ]: Start isEmpty. Operand 270 states and 744 transitions. [2018-06-26 18:28:55,953 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-26 18:28:55,953 INFO ]: Found error trace [2018-06-26 18:28:55,953 INFO ]: trace histogram [9, 8, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:55,953 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:55,953 INFO ]: Analyzing trace with hash -1371447566, now seen corresponding path program 3 times [2018-06-26 18:28:55,953 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:55,953 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:55,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:55,955 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:28:55,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:55,980 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:56,169 INFO ]: Checked inductivity of 252 backedges. 69 proven. 74 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-06-26 18:28:56,169 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:28:56,169 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:28:56,174 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:28:56,326 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-26 18:28:56,326 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:56,332 INFO ]: Computing forward predicates... [2018-06-26 18:28:56,374 INFO ]: Checked inductivity of 252 backedges. 25 proven. 50 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-06-26 18:28:56,396 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:28:56,396 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-06-26 18:28:56,397 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:28:56,397 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:28:56,397 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:28:56,397 INFO ]: Start difference. First operand 270 states and 744 transitions. Second operand 10 states. [2018-06-26 18:28:57,061 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:57,061 INFO ]: Finished difference Result 563 states and 1729 transitions. [2018-06-26 18:28:57,061 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 18:28:57,061 INFO ]: Start accepts. Automaton has 10 states. Word has length 56 [2018-06-26 18:28:57,061 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:57,079 INFO ]: With dead ends: 563 [2018-06-26 18:28:57,079 INFO ]: Without dead ends: 563 [2018-06-26 18:28:57,079 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:28:57,080 INFO ]: Start minimizeSevpa. Operand 563 states. [2018-06-26 18:28:57,152 INFO ]: Finished minimizeSevpa. Reduced states from 563 to 335. [2018-06-26 18:28:57,152 INFO ]: Start removeUnreachable. Operand 335 states. [2018-06-26 18:28:57,160 INFO ]: Finished removeUnreachable. Reduced from 335 states to 335 states and 957 transitions. [2018-06-26 18:28:57,160 INFO ]: Start accepts. Automaton has 335 states and 957 transitions. Word has length 56 [2018-06-26 18:28:57,161 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:57,161 INFO ]: Abstraction has 335 states and 957 transitions. [2018-06-26 18:28:57,161 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:28:57,161 INFO ]: Start isEmpty. Operand 335 states and 957 transitions. [2018-06-26 18:28:57,189 INFO ]: Finished isEmpty. Found accepting run of length 67 [2018-06-26 18:28:57,189 INFO ]: Found error trace [2018-06-26 18:28:57,189 INFO ]: trace histogram [12, 9, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:57,189 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:57,190 INFO ]: Analyzing trace with hash -1347723160, now seen corresponding path program 4 times [2018-06-26 18:28:57,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:57,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:57,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:57,190 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:28:57,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:57,248 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:57,649 WARN ]: Spent 171.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-06-26 18:28:57,846 INFO ]: Checked inductivity of 385 backedges. 98 proven. 176 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-06-26 18:28:57,846 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:28:57,846 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:28:57,852 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:28:58,076 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:28:58,076 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:58,084 INFO ]: Computing forward predicates... [2018-06-26 18:28:58,207 INFO ]: Checked inductivity of 385 backedges. 222 proven. 48 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-06-26 18:28:58,228 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:28:58,228 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2018-06-26 18:28:58,228 INFO ]: Interpolant automaton has 21 states [2018-06-26 18:28:58,228 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 18:28:58,228 INFO ]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:28:58,228 INFO ]: Start difference. First operand 335 states and 957 transitions. Second operand 21 states. [2018-06-26 18:29:02,395 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-26 18:29:06,713 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:29:06,713 INFO ]: Finished difference Result 1426 states and 5817 transitions. [2018-06-26 18:29:06,713 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-06-26 18:29:06,713 INFO ]: Start accepts. Automaton has 21 states. Word has length 66 [2018-06-26 18:29:06,713 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:29:06,713 INFO ]: With dead ends: 1426 [2018-06-26 18:29:06,713 INFO ]: Without dead ends: 0 [2018-06-26 18:29:06,717 INFO ]: 0 DeclaredPredicates, 214 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5473 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1299, Invalid=14451, Unknown=0, NotChecked=0, Total=15750 [2018-06-26 18:29:06,717 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 18:29:06,717 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 18:29:06,717 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 18:29:06,717 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 18:29:06,717 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-06-26 18:29:06,717 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:29:06,717 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 18:29:06,717 INFO ]: Interpolant automaton has 21 states. [2018-06-26 18:29:06,717 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 18:29:06,717 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 18:29:06,719 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:29:06,720 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:29:06 BasicIcfg [2018-06-26 18:29:06,720 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:29:06,720 INFO ]: Toolchain (without parser) took 35489.10 ms. Allocated memory was 304.6 MB in the beginning and 907.5 MB in the end (delta: 602.9 MB). Free memory was 233.0 MB in the beginning and 523.4 MB in the end (delta: -290.4 MB). Peak memory consumption was 312.5 MB. Max. memory is 3.6 GB. [2018-06-26 18:29:06,721 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.6 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:29:06,721 INFO ]: ChcToBoogie took 94.19 ms. Allocated memory is still 304.6 MB. Free memory was 233.0 MB in the beginning and 227.1 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:29:06,721 INFO ]: Boogie Preprocessor took 57.60 ms. Allocated memory is still 304.6 MB. Free memory was 227.1 MB in the beginning and 225.1 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:29:06,722 INFO ]: RCFGBuilder took 1092.54 ms. Allocated memory was 304.6 MB in the beginning and 324.0 MB in the end (delta: 19.4 MB). Free memory was 225.1 MB in the beginning and 289.7 MB in the end (delta: -64.7 MB). Peak memory consumption was 47.5 MB. Max. memory is 3.6 GB. [2018-06-26 18:29:06,722 INFO ]: BlockEncodingV2 took 3522.07 ms. Allocated memory was 324.0 MB in the beginning and 388.5 MB in the end (delta: 64.5 MB). Free memory was 289.7 MB in the beginning and 231.4 MB in the end (delta: 58.4 MB). Peak memory consumption was 177.6 MB. Max. memory is 3.6 GB. [2018-06-26 18:29:06,723 INFO ]: TraceAbstraction took 30713.30 ms. Allocated memory was 388.5 MB in the beginning and 907.5 MB in the end (delta: 519.0 MB). Free memory was 231.4 MB in the beginning and 523.4 MB in the end (delta: -292.0 MB). Peak memory consumption was 227.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:29:06,730 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 48 locations, 77 edges - StatisticsResult: Encoded RCFG 30 locations, 103 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 304.6 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 94.19 ms. Allocated memory is still 304.6 MB. Free memory was 233.0 MB in the beginning and 227.1 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 57.60 ms. Allocated memory is still 304.6 MB. Free memory was 227.1 MB in the beginning and 225.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1092.54 ms. Allocated memory was 304.6 MB in the beginning and 324.0 MB in the end (delta: 19.4 MB). Free memory was 225.1 MB in the beginning and 289.7 MB in the end (delta: -64.7 MB). Peak memory consumption was 47.5 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 3522.07 ms. Allocated memory was 324.0 MB in the beginning and 388.5 MB in the end (delta: 64.5 MB). Free memory was 289.7 MB in the beginning and 231.4 MB in the end (delta: 58.4 MB). Peak memory consumption was 177.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 30713.30 ms. Allocated memory was 388.5 MB in the beginning and 907.5 MB in the end (delta: 519.0 MB). Free memory was 231.4 MB in the beginning and 523.4 MB in the end (delta: -292.0 MB). Peak memory consumption was 227.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. SAFE Result, 30.6s OverallTime, 17 OverallIterations, 12 TraceHistogramMax, 22.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1285 SDtfs, 1190 SDslu, 4849 SDs, 0 SdLazy, 16839 SolverSat, 2194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 854 GetRequests, 471 SyntacticMatches, 2 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8187 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 880 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 813 NumberOfCodeBlocks, 794 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 786 ConstructedInterpolants, 0 QuantifiedInterpolants, 65567 SizeOfPredicates, 57 NumberOfNonLiveVariables, 11455 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 2049/2627 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann06.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-29-06-744.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann06.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-29-06-744.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann06.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-29-06-744.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann06.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-29-06-744.csv Received shutdown request...