java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/termination/Ackermann04.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:27:31,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:27:31,158 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:27:31,170 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:27:31,170 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:27:31,171 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:27:31,172 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:27:31,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:27:31,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:27:31,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:27:31,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:27:31,184 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:27:31,185 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:27:31,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:27:31,187 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:27:31,188 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:27:31,188 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:27:31,190 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:27:31,192 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:27:31,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:27:31,194 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:27:31,195 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:27:31,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:27:31,198 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:27:31,198 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:27:31,199 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:27:31,200 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:27:31,200 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:27:31,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:27:31,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:27:31,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:27:31,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:27:31,203 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:27:31,203 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:27:31,204 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:27:31,205 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:27:31,205 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:27:31,223 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:27:31,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:27:31,224 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:27:31,224 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:27:31,225 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:27:31,225 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:27:31,225 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:27:31,226 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:27:31,226 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:27:31,226 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:27:31,226 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:27:31,226 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:27:31,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:27:31,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:27:31,227 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:27:31,227 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:27:31,227 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:27:31,227 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:27:31,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:27:31,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:27:31,228 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:27:31,229 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:27:31,230 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:27:31,273 INFO ]: Repository-Root is: /tmp [2018-06-26 18:27:31,287 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:27:31,291 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:27:31,292 INFO ]: Initializing SmtParser... [2018-06-26 18:27:31,292 INFO ]: SmtParser initialized [2018-06-26 18:27:31,293 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/termination/Ackermann04.smt2 [2018-06-26 18:27:31,294 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:27:31,380 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/termination/Ackermann04.smt2 unknown [2018-06-26 18:27:32,098 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/termination/Ackermann04.smt2 [2018-06-26 18:27:32,105 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:27:32,110 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:27:32,110 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:27:32,110 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:27:32,111 INFO ]: ChcToBoogie initialized [2018-06-26 18:27:32,114 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:27:32" (1/1) ... [2018-06-26 18:27:32,189 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:27:32 Unit [2018-06-26 18:27:32,189 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:27:32,190 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:27:32,190 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:27:32,190 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:27:32,212 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:27:32" (1/1) ... [2018-06-26 18:27:32,212 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:27:32" (1/1) ... [2018-06-26 18:27:32,224 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:27:32" (1/1) ... [2018-06-26 18:27:32,224 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:27:32" (1/1) ... [2018-06-26 18:27:32,238 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:27:32" (1/1) ... [2018-06-26 18:27:32,241 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:27:32" (1/1) ... [2018-06-26 18:27:32,244 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:27:32" (1/1) ... [2018-06-26 18:27:32,249 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:27:32,249 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:27:32,249 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:27:32,249 INFO ]: RCFGBuilder initialized [2018-06-26 18:27:32,250 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:27:32" (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:27:32,263 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:27:32,263 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:27:32,263 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:27:32,263 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:27:32,263 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:27:32,263 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:27:33,171 INFO ]: Using library mode [2018-06-26 18:27:33,174 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:27:33 BoogieIcfgContainer [2018-06-26 18:27:33,174 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:27:33,174 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:27:33,174 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:27:33,175 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:27:33,176 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:27:33" (1/1) ... [2018-06-26 18:27:33,206 INFO ]: Initial Icfg 49 locations, 79 edges [2018-06-26 18:27:33,207 INFO ]: Using Remove infeasible edges [2018-06-26 18:27:33,208 INFO ]: Using Maximize final states [2018-06-26 18:27:33,209 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:27:33,209 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:27:33,210 INFO ]: Using Remove sink states [2018-06-26 18:27:33,211 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:27:33,211 INFO ]: Using Use SBE [2018-06-26 18:27:33,216 WARN ]: expecting exponential blowup for input size 9 [2018-06-26 18:27:33,377 WARN ]: expecting exponential blowup for input size 9 [2018-06-26 18:27:33,487 WARN ]: expecting exponential blowup for input size 9 [2018-06-26 18:27:33,632 WARN ]: expecting exponential blowup for input size 9 [2018-06-26 18:27:33,737 WARN ]: expecting exponential blowup for input size 9 [2018-06-26 18:27:33,879 INFO ]: SBE split 5 edges [2018-06-26 18:27:33,886 INFO ]: Removed 4 edges and 2 locations because of local infeasibility [2018-06-26 18:27:33,888 INFO ]: 0 new accepting states [2018-06-26 18:27:36,456 INFO ]: Removed 213 edges and 13 locations by large block encoding [2018-06-26 18:27:36,459 INFO ]: Removed 4 edges and 3 locations by removing sink states [2018-06-26 18:27:36,461 INFO ]: Removed 38 edges and 0 locations because of local infeasibility [2018-06-26 18:27:36,461 INFO ]: 0 new accepting states [2018-06-26 18:27:36,462 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:27:36,462 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:27:36,462 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:27:36,462 INFO ]: 0 new accepting states [2018-06-26 18:27:36,463 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:27:36,464 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:27:36,466 INFO ]: Encoded RCFG 31 locations, 118 edges [2018-06-26 18:27:36,466 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:27:36 BasicIcfg [2018-06-26 18:27:36,466 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:27:36,467 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:27:36,467 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:27:36,471 INFO ]: TraceAbstraction initialized [2018-06-26 18:27:36,471 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:27:32" (1/4) ... [2018-06-26 18:27:36,472 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a55f118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:27:36, skipping insertion in model container [2018-06-26 18:27:36,472 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:27:32" (2/4) ... [2018-06-26 18:27:36,472 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a55f118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:27:36, skipping insertion in model container [2018-06-26 18:27:36,472 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:27:33" (3/4) ... [2018-06-26 18:27:36,473 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a55f118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:27:36, skipping insertion in model container [2018-06-26 18:27:36,473 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:27:36" (4/4) ... [2018-06-26 18:27:36,474 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:27:36,483 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:27:36,489 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:27:36,524 INFO ]: Using default assertion order modulation [2018-06-26 18:27:36,525 INFO ]: Interprodecural is true [2018-06-26 18:27:36,525 INFO ]: Hoare is false [2018-06-26 18:27:36,525 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:27:36,525 INFO ]: Backedges is TWOTRACK [2018-06-26 18:27:36,525 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:27:36,525 INFO ]: Difference is false [2018-06-26 18:27:36,525 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:27:36,525 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:27:36,545 INFO ]: Start isEmpty. Operand 31 states. [2018-06-26 18:27:36,570 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:27:36,571 INFO ]: Found error trace [2018-06-26 18:27:36,571 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:27:36,572 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:27:36,578 INFO ]: Analyzing trace with hash 79910499, now seen corresponding path program 1 times [2018-06-26 18:27:36,580 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:27:36,580 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:27:36,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:36,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:36,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:36,707 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:36,879 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:27:36,881 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:27:36,882 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:27:36,883 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:27:36,899 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:27:36,899 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:27:36,901 INFO ]: Start difference. First operand 31 states. Second operand 3 states. [2018-06-26 18:27:37,511 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:27:37,511 INFO ]: Finished difference Result 44 states and 153 transitions. [2018-06-26 18:27:37,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:27:37,512 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:27:37,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:27:37,524 INFO ]: With dead ends: 44 [2018-06-26 18:27:37,524 INFO ]: Without dead ends: 35 [2018-06-26 18:27:37,526 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:27:37,553 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 18:27:37,583 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-06-26 18:27:37,584 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 18:27:37,586 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 55 transitions. [2018-06-26 18:27:37,587 INFO ]: Start accepts. Automaton has 26 states and 55 transitions. Word has length 5 [2018-06-26 18:27:37,588 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:27:37,588 INFO ]: Abstraction has 26 states and 55 transitions. [2018-06-26 18:27:37,588 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:27:37,588 INFO ]: Start isEmpty. Operand 26 states and 55 transitions. [2018-06-26 18:27:37,591 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:27:37,591 INFO ]: Found error trace [2018-06-26 18:27:37,591 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:27:37,591 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:27:37,592 INFO ]: Analyzing trace with hash 79940290, now seen corresponding path program 1 times [2018-06-26 18:27:37,592 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:27:37,592 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:27:37,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:37,593 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:37,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:37,604 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:37,647 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:27:37,647 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:27:37,647 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:27:37,649 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:27:37,649 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:27:37,649 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:27:37,649 INFO ]: Start difference. First operand 26 states and 55 transitions. Second operand 3 states. [2018-06-26 18:27:37,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:27:37,885 INFO ]: Finished difference Result 38 states and 94 transitions. [2018-06-26 18:27:37,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:27:37,885 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:27:37,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:27:37,897 INFO ]: With dead ends: 38 [2018-06-26 18:27:37,897 INFO ]: Without dead ends: 38 [2018-06-26 18:27:37,898 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:27:37,898 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 18:27:37,915 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-26 18:27:37,915 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 18:27:37,919 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 94 transitions. [2018-06-26 18:27:37,920 INFO ]: Start accepts. Automaton has 38 states and 94 transitions. Word has length 5 [2018-06-26 18:27:37,920 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:27:37,920 INFO ]: Abstraction has 38 states and 94 transitions. [2018-06-26 18:27:37,920 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:27:37,920 INFO ]: Start isEmpty. Operand 38 states and 94 transitions. [2018-06-26 18:27:37,928 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:27:37,928 INFO ]: Found error trace [2018-06-26 18:27:37,928 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:27:37,928 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:27:37,928 INFO ]: Analyzing trace with hash 80029663, now seen corresponding path program 1 times [2018-06-26 18:27:37,928 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:27:37,928 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:27:37,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:37,929 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:37,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:37,937 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:37,999 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:27:37,999 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:27:37,999 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:27:37,999 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:27:37,999 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:27:37,999 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:27:37,999 INFO ]: Start difference. First operand 38 states and 94 transitions. Second operand 3 states. [2018-06-26 18:27:38,291 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:27:38,291 INFO ]: Finished difference Result 51 states and 114 transitions. [2018-06-26 18:27:38,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:27:38,323 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:27:38,323 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:27:38,325 INFO ]: With dead ends: 51 [2018-06-26 18:27:38,325 INFO ]: Without dead ends: 39 [2018-06-26 18:27:38,325 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:27:38,325 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 18:27:38,332 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-26 18:27:38,332 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 18:27:38,333 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 87 transitions. [2018-06-26 18:27:38,333 INFO ]: Start accepts. Automaton has 39 states and 87 transitions. Word has length 5 [2018-06-26 18:27:38,334 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:27:38,334 INFO ]: Abstraction has 39 states and 87 transitions. [2018-06-26 18:27:38,334 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:27:38,334 INFO ]: Start isEmpty. Operand 39 states and 87 transitions. [2018-06-26 18:27:38,337 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:27:38,337 INFO ]: Found error trace [2018-06-26 18:27:38,337 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:27:38,337 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:27:38,337 INFO ]: Analyzing trace with hash -1875146276, now seen corresponding path program 1 times [2018-06-26 18:27:38,337 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:27:38,337 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:27:38,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:38,338 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:38,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:38,405 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:38,461 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:27:38,461 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:27:38,461 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:27:38,461 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:27:38,461 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:27:38,461 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:27:38,461 INFO ]: Start difference. First operand 39 states and 87 transitions. Second operand 3 states. [2018-06-26 18:27:38,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:27:38,621 INFO ]: Finished difference Result 52 states and 112 transitions. [2018-06-26 18:27:38,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:27:38,621 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 18:27:38,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:27:38,623 INFO ]: With dead ends: 52 [2018-06-26 18:27:38,623 INFO ]: Without dead ends: 52 [2018-06-26 18:27:38,624 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:27:38,624 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-26 18:27:38,630 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-06-26 18:27:38,630 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-26 18:27:38,632 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 112 transitions. [2018-06-26 18:27:38,632 INFO ]: Start accepts. Automaton has 52 states and 112 transitions. Word has length 11 [2018-06-26 18:27:38,632 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:27:38,632 INFO ]: Abstraction has 52 states and 112 transitions. [2018-06-26 18:27:38,632 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:27:38,632 INFO ]: Start isEmpty. Operand 52 states and 112 transitions. [2018-06-26 18:27:38,635 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:27:38,635 INFO ]: Found error trace [2018-06-26 18:27:38,636 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:27:38,636 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:27:38,636 INFO ]: Analyzing trace with hash 1404984025, now seen corresponding path program 1 times [2018-06-26 18:27:38,636 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:27:38,636 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:27:38,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:38,636 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:38,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:38,676 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:38,815 INFO ]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:27:38,815 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:27:38,815 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:27:38,815 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:27:38,815 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:27:38,815 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:27:38,815 INFO ]: Start difference. First operand 52 states and 112 transitions. Second operand 4 states. [2018-06-26 18:27:39,249 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:27:39,249 INFO ]: Finished difference Result 107 states and 261 transitions. [2018-06-26 18:27:39,249 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:27:39,249 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-26 18:27:39,250 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:27:39,254 INFO ]: With dead ends: 107 [2018-06-26 18:27:39,254 INFO ]: Without dead ends: 107 [2018-06-26 18:27:39,254 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:27:39,255 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-26 18:27:39,271 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 53. [2018-06-26 18:27:39,271 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-26 18:27:39,273 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 115 transitions. [2018-06-26 18:27:39,273 INFO ]: Start accepts. Automaton has 53 states and 115 transitions. Word has length 12 [2018-06-26 18:27:39,273 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:27:39,273 INFO ]: Abstraction has 53 states and 115 transitions. [2018-06-26 18:27:39,273 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:27:39,273 INFO ]: Start isEmpty. Operand 53 states and 115 transitions. [2018-06-26 18:27:39,275 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:27:39,275 INFO ]: Found error trace [2018-06-26 18:27:39,276 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:27:39,276 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:27:39,276 INFO ]: Analyzing trace with hash 1437181052, now seen corresponding path program 1 times [2018-06-26 18:27:39,276 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:27:39,276 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:27:39,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:39,276 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:39,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:39,308 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:39,493 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:27:39,493 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:27:39,493 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:27:39,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:39,584 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:39,595 INFO ]: Computing forward predicates... [2018-06-26 18:27:39,715 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:27:39,751 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:27:39,751 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 18:27:39,752 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:27:39,752 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:27:39,752 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:27:39,752 INFO ]: Start difference. First operand 53 states and 115 transitions. Second operand 6 states. [2018-06-26 18:27:40,012 WARN ]: Spent 167.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-06-26 18:27:41,246 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:27:41,246 INFO ]: Finished difference Result 150 states and 430 transitions. [2018-06-26 18:27:41,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:27:41,247 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-26 18:27:41,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:27:41,253 INFO ]: With dead ends: 150 [2018-06-26 18:27:41,253 INFO ]: Without dead ends: 149 [2018-06-26 18:27:41,253 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:27:41,253 INFO ]: Start minimizeSevpa. Operand 149 states. [2018-06-26 18:27:41,293 INFO ]: Finished minimizeSevpa. Reduced states from 149 to 73. [2018-06-26 18:27:41,294 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-26 18:27:41,295 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 172 transitions. [2018-06-26 18:27:41,295 INFO ]: Start accepts. Automaton has 73 states and 172 transitions. Word has length 12 [2018-06-26 18:27:41,296 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:27:41,296 INFO ]: Abstraction has 73 states and 172 transitions. [2018-06-26 18:27:41,296 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:27:41,296 INFO ]: Start isEmpty. Operand 73 states and 172 transitions. [2018-06-26 18:27:41,298 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:27:41,298 INFO ]: Found error trace [2018-06-26 18:27:41,298 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:27:41,299 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:27:41,299 INFO ]: Analyzing trace with hash 361166234, now seen corresponding path program 1 times [2018-06-26 18:27:41,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:27:41,299 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:27:41,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:41,300 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:41,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:41,313 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:41,382 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:27:41,382 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:27:41,382 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:27:41,382 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:27:41,382 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:27:41,382 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:27:41,382 INFO ]: Start difference. First operand 73 states and 172 transitions. Second operand 3 states. [2018-06-26 18:27:41,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:27:41,628 INFO ]: Finished difference Result 88 states and 198 transitions. [2018-06-26 18:27:41,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:27:41,629 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 18:27:41,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:27:41,630 INFO ]: With dead ends: 88 [2018-06-26 18:27:41,630 INFO ]: Without dead ends: 88 [2018-06-26 18:27:41,630 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:27:41,630 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-26 18:27:41,642 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-06-26 18:27:41,642 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-26 18:27:41,644 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 198 transitions. [2018-06-26 18:27:41,644 INFO ]: Start accepts. Automaton has 88 states and 198 transitions. Word has length 12 [2018-06-26 18:27:41,645 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:27:41,645 INFO ]: Abstraction has 88 states and 198 transitions. [2018-06-26 18:27:41,645 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:27:41,645 INFO ]: Start isEmpty. Operand 88 states and 198 transitions. [2018-06-26 18:27:41,649 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:27:41,649 INFO ]: Found error trace [2018-06-26 18:27:41,649 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:27:41,649 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:27:41,649 INFO ]: Analyzing trace with hash 1958367424, now seen corresponding path program 1 times [2018-06-26 18:27:41,649 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:27:41,649 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:27:41,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:41,650 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:41,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:41,673 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:41,722 INFO ]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 18:27:41,722 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:27:41,722 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:27:41,723 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:27:41,723 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:27:41,723 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:27:41,723 INFO ]: Start difference. First operand 88 states and 198 transitions. Second operand 3 states. [2018-06-26 18:27:41,796 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:27:41,797 INFO ]: Finished difference Result 103 states and 229 transitions. [2018-06-26 18:27:41,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:27:41,797 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 18:27:41,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:27:41,799 INFO ]: With dead ends: 103 [2018-06-26 18:27:41,799 INFO ]: Without dead ends: 103 [2018-06-26 18:27:41,800 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:27:41,800 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-26 18:27:41,812 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-06-26 18:27:41,812 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-26 18:27:41,814 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 229 transitions. [2018-06-26 18:27:41,814 INFO ]: Start accepts. Automaton has 103 states and 229 transitions. Word has length 18 [2018-06-26 18:27:41,814 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:27:41,814 INFO ]: Abstraction has 103 states and 229 transitions. [2018-06-26 18:27:41,814 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:27:41,814 INFO ]: Start isEmpty. Operand 103 states and 229 transitions. [2018-06-26 18:27:41,818 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 18:27:41,819 INFO ]: Found error trace [2018-06-26 18:27:41,819 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:27:41,819 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:27:41,819 INFO ]: Analyzing trace with hash -545149885, now seen corresponding path program 1 times [2018-06-26 18:27:41,819 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:27:41,819 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:27:41,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:41,819 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:41,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:41,845 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:41,934 INFO ]: Checked inductivity of 35 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 18:27:41,934 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:27:41,934 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:27:41,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:42,075 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:42,081 INFO ]: Computing forward predicates... [2018-06-26 18:27:42,411 INFO ]: Checked inductivity of 35 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 18:27:42,439 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:27:42,439 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-06-26 18:27:42,439 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:27:42,439 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:27:42,439 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:27:42,439 INFO ]: Start difference. First operand 103 states and 229 transitions. Second operand 11 states. [2018-06-26 18:27:46,298 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:27:46,298 INFO ]: Finished difference Result 472 states and 1577 transitions. [2018-06-26 18:27:46,298 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-06-26 18:27:46,298 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-26 18:27:46,298 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:27:46,321 INFO ]: With dead ends: 472 [2018-06-26 18:27:46,321 INFO ]: Without dead ends: 472 [2018-06-26 18:27:46,323 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=699, Invalid=4271, Unknown=0, NotChecked=0, Total=4970 [2018-06-26 18:27:46,323 INFO ]: Start minimizeSevpa. Operand 472 states. [2018-06-26 18:27:46,424 INFO ]: Finished minimizeSevpa. Reduced states from 472 to 195. [2018-06-26 18:27:46,424 INFO ]: Start removeUnreachable. Operand 195 states. [2018-06-26 18:27:46,428 INFO ]: Finished removeUnreachable. Reduced from 195 states to 195 states and 451 transitions. [2018-06-26 18:27:46,428 INFO ]: Start accepts. Automaton has 195 states and 451 transitions. Word has length 28 [2018-06-26 18:27:46,428 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:27:46,428 INFO ]: Abstraction has 195 states and 451 transitions. [2018-06-26 18:27:46,428 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:27:46,428 INFO ]: Start isEmpty. Operand 195 states and 451 transitions. [2018-06-26 18:27:46,446 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 18:27:46,446 INFO ]: Found error trace [2018-06-26 18:27:46,446 INFO ]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:27:46,446 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:27:46,447 INFO ]: Analyzing trace with hash 1017288404, now seen corresponding path program 1 times [2018-06-26 18:27:46,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:27:46,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:27:46,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:46,447 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:46,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:46,479 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:46,603 INFO ]: Checked inductivity of 59 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:27:46,603 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:27:46,603 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:27:46,616 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:46,753 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:46,759 INFO ]: Computing forward predicates... [2018-06-26 18:27:47,168 INFO ]: Checked inductivity of 59 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-26 18:27:47,200 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:27:47,200 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-26 18:27:47,200 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:27:47,200 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:27:47,200 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:27:47,201 INFO ]: Start difference. First operand 195 states and 451 transitions. Second operand 11 states. [2018-06-26 18:27:50,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:27:50,855 INFO ]: Finished difference Result 599 states and 1832 transitions. [2018-06-26 18:27:50,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-06-26 18:27:50,856 INFO ]: Start accepts. Automaton has 11 states. Word has length 35 [2018-06-26 18:27:50,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:27:50,900 INFO ]: With dead ends: 599 [2018-06-26 18:27:50,900 INFO ]: Without dead ends: 599 [2018-06-26 18:27:50,901 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=389, Invalid=2473, Unknown=0, NotChecked=0, Total=2862 [2018-06-26 18:27:50,901 INFO ]: Start minimizeSevpa. Operand 599 states. [2018-06-26 18:27:51,004 INFO ]: Finished minimizeSevpa. Reduced states from 599 to 291. [2018-06-26 18:27:51,004 INFO ]: Start removeUnreachable. Operand 291 states. [2018-06-26 18:27:51,015 INFO ]: Finished removeUnreachable. Reduced from 291 states to 291 states and 705 transitions. [2018-06-26 18:27:51,015 INFO ]: Start accepts. Automaton has 291 states and 705 transitions. Word has length 35 [2018-06-26 18:27:51,015 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:27:51,015 INFO ]: Abstraction has 291 states and 705 transitions. [2018-06-26 18:27:51,015 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:27:51,015 INFO ]: Start isEmpty. Operand 291 states and 705 transitions. [2018-06-26 18:27:51,037 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 18:27:51,037 INFO ]: Found error trace [2018-06-26 18:27:51,037 INFO ]: trace histogram [6, 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] [2018-06-26 18:27:51,037 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:27:51,038 INFO ]: Analyzing trace with hash 831563699, now seen corresponding path program 1 times [2018-06-26 18:27:51,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:27:51,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:27:51,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:51,039 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:51,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:51,056 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:51,166 INFO ]: Checked inductivity of 52 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-26 18:27:51,166 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:27:51,166 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:27:51,180 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:51,305 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:51,312 INFO ]: Computing forward predicates... [2018-06-26 18:27:51,332 INFO ]: Checked inductivity of 52 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:27:51,352 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:27:51,352 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-06-26 18:27:51,352 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:27:51,353 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:27:51,353 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:27:51,353 INFO ]: Start difference. First operand 291 states and 705 transitions. Second operand 6 states. [2018-06-26 18:27:51,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:27:51,454 INFO ]: Finished difference Result 358 states and 1003 transitions. [2018-06-26 18:27:51,457 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:27:51,457 INFO ]: Start accepts. Automaton has 6 states. Word has length 34 [2018-06-26 18:27:51,457 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:27:51,467 INFO ]: With dead ends: 358 [2018-06-26 18:27:51,467 INFO ]: Without dead ends: 358 [2018-06-26 18:27:51,467 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:27:51,467 INFO ]: Start minimizeSevpa. Operand 358 states. [2018-06-26 18:27:51,501 INFO ]: Finished minimizeSevpa. Reduced states from 358 to 252. [2018-06-26 18:27:51,501 INFO ]: Start removeUnreachable. Operand 252 states. [2018-06-26 18:27:51,513 INFO ]: Finished removeUnreachable. Reduced from 252 states to 252 states and 626 transitions. [2018-06-26 18:27:51,513 INFO ]: Start accepts. Automaton has 252 states and 626 transitions. Word has length 34 [2018-06-26 18:27:51,513 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:27:51,513 INFO ]: Abstraction has 252 states and 626 transitions. [2018-06-26 18:27:51,513 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:27:51,513 INFO ]: Start isEmpty. Operand 252 states and 626 transitions. [2018-06-26 18:27:51,532 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 18:27:51,532 INFO ]: Found error trace [2018-06-26 18:27:51,533 INFO ]: trace histogram [6, 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] [2018-06-26 18:27:51,533 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:27:51,533 INFO ]: Analyzing trace with hash -1036813583, now seen corresponding path program 2 times [2018-06-26 18:27:51,533 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:27:51,533 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:27:51,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:51,535 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:51,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:51,559 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:51,649 INFO ]: Checked inductivity of 52 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-26 18:27:51,649 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:27:51,649 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:27:51,650 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:27:51,650 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:27:51,650 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:27:51,650 INFO ]: Start difference. First operand 252 states and 626 transitions. Second operand 3 states. [2018-06-26 18:27:51,788 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:27:51,788 INFO ]: Finished difference Result 268 states and 656 transitions. [2018-06-26 18:27:51,789 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:27:51,789 INFO ]: Start accepts. Automaton has 3 states. Word has length 34 [2018-06-26 18:27:51,789 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:27:51,795 INFO ]: With dead ends: 268 [2018-06-26 18:27:51,795 INFO ]: Without dead ends: 268 [2018-06-26 18:27:51,795 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:27:51,795 INFO ]: Start minimizeSevpa. Operand 268 states. [2018-06-26 18:27:51,816 INFO ]: Finished minimizeSevpa. Reduced states from 268 to 266. [2018-06-26 18:27:51,816 INFO ]: Start removeUnreachable. Operand 266 states. [2018-06-26 18:27:51,820 INFO ]: Finished removeUnreachable. Reduced from 266 states to 266 states and 651 transitions. [2018-06-26 18:27:51,820 INFO ]: Start accepts. Automaton has 266 states and 651 transitions. Word has length 34 [2018-06-26 18:27:51,821 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:27:51,821 INFO ]: Abstraction has 266 states and 651 transitions. [2018-06-26 18:27:51,821 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:27:51,821 INFO ]: Start isEmpty. Operand 266 states and 651 transitions. [2018-06-26 18:27:51,832 INFO ]: Finished isEmpty. Found accepting run of length 56 [2018-06-26 18:27:51,832 INFO ]: Found error trace [2018-06-26 18:27:51,832 INFO ]: trace histogram [9, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:27:51,832 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:27:51,833 INFO ]: Analyzing trace with hash -1105824523, now seen corresponding path program 1 times [2018-06-26 18:27:51,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:27:51,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:27:51,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:51,835 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:27:51,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:51,882 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:52,362 INFO ]: Checked inductivity of 163 backedges. 71 proven. 9 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-26 18:27:52,362 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:27:52,362 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:27:52,368 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:52,621 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:52,640 INFO ]: Computing forward predicates... [2018-06-26 18:27:52,757 INFO ]: Checked inductivity of 163 backedges. 75 proven. 5 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-26 18:27:52,777 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:27:52,777 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-06-26 18:27:52,778 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:27:52,778 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:27:52,778 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:27:52,778 INFO ]: Start difference. First operand 266 states and 651 transitions. Second operand 15 states. [2018-06-26 18:27:56,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:27:56,990 INFO ]: Finished difference Result 732 states and 2432 transitions. [2018-06-26 18:27:56,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-06-26 18:27:56,990 INFO ]: Start accepts. Automaton has 15 states. Word has length 55 [2018-06-26 18:27:56,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:27:57,019 INFO ]: With dead ends: 732 [2018-06-26 18:27:57,019 INFO ]: Without dead ends: 732 [2018-06-26 18:27:57,021 INFO ]: 0 DeclaredPredicates, 164 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3048 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=766, Invalid=8164, Unknown=0, NotChecked=0, Total=8930 [2018-06-26 18:27:57,021 INFO ]: Start minimizeSevpa. Operand 732 states. [2018-06-26 18:27:57,111 INFO ]: Finished minimizeSevpa. Reduced states from 732 to 307. [2018-06-26 18:27:57,111 INFO ]: Start removeUnreachable. Operand 307 states. [2018-06-26 18:27:57,116 INFO ]: Finished removeUnreachable. Reduced from 307 states to 307 states and 772 transitions. [2018-06-26 18:27:57,116 INFO ]: Start accepts. Automaton has 307 states and 772 transitions. Word has length 55 [2018-06-26 18:27:57,117 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:27:57,117 INFO ]: Abstraction has 307 states and 772 transitions. [2018-06-26 18:27:57,117 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:27:57,117 INFO ]: Start isEmpty. Operand 307 states and 772 transitions. [2018-06-26 18:27:57,131 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-26 18:27:57,131 INFO ]: Found error trace [2018-06-26 18:27:57,131 INFO ]: trace histogram [10, 5, 4, 4, 4, 4, 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] [2018-06-26 18:27:57,131 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:27:57,131 INFO ]: Analyzing trace with hash -738741256, now seen corresponding path program 1 times [2018-06-26 18:27:57,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:27:57,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:27:57,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:57,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:57,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:27:57,217 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:57,663 INFO ]: Checked inductivity of 249 backedges. 111 proven. 20 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-26 18:27:57,663 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:27:57,663 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:27:57,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:27:57,896 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:27:57,906 INFO ]: Computing forward predicates... [2018-06-26 18:27:57,995 INFO ]: Checked inductivity of 249 backedges. 112 proven. 5 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-06-26 18:27:58,015 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:27:58,015 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-06-26 18:27:58,015 INFO ]: Interpolant automaton has 18 states [2018-06-26 18:27:58,016 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 18:27:58,016 INFO ]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:27:58,016 INFO ]: Start difference. First operand 307 states and 772 transitions. Second operand 18 states. [2018-06-26 18:28:02,573 WARN ]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-26 18:28:14,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:14,763 INFO ]: Finished difference Result 2450 states and 13101 transitions. [2018-06-26 18:28:14,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2018-06-26 18:28:14,763 INFO ]: Start accepts. Automaton has 18 states. Word has length 64 [2018-06-26 18:28:14,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:15,133 INFO ]: With dead ends: 2450 [2018-06-26 18:28:15,133 INFO ]: Without dead ends: 2450 [2018-06-26 18:28:15,142 INFO ]: 0 DeclaredPredicates, 417 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24972 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4292, Invalid=54030, Unknown=0, NotChecked=0, Total=58322 [2018-06-26 18:28:15,143 INFO ]: Start minimizeSevpa. Operand 2450 states. [2018-06-26 18:28:16,573 INFO ]: Finished minimizeSevpa. Reduced states from 2450 to 595. [2018-06-26 18:28:16,573 INFO ]: Start removeUnreachable. Operand 595 states. [2018-06-26 18:28:16,614 INFO ]: Finished removeUnreachable. Reduced from 595 states to 595 states and 1723 transitions. [2018-06-26 18:28:16,614 INFO ]: Start accepts. Automaton has 595 states and 1723 transitions. Word has length 64 [2018-06-26 18:28:16,614 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:16,614 INFO ]: Abstraction has 595 states and 1723 transitions. [2018-06-26 18:28:16,614 INFO ]: Interpolant automaton has 18 states. [2018-06-26 18:28:16,614 INFO ]: Start isEmpty. Operand 595 states and 1723 transitions. [2018-06-26 18:28:16,669 INFO ]: Finished isEmpty. Found accepting run of length 56 [2018-06-26 18:28:16,669 INFO ]: Found error trace [2018-06-26 18:28:16,669 INFO ]: trace histogram [10, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:16,669 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:16,670 INFO ]: Analyzing trace with hash -1281124078, now seen corresponding path program 1 times [2018-06-26 18:28:16,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:16,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:16,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:16,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:16,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:16,702 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:17,608 INFO ]: Checked inductivity of 153 backedges. 53 proven. 17 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-26 18:28:17,608 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:28:17,608 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 18:28:17,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:28:17,833 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:17,844 INFO ]: Computing forward predicates... [2018-06-26 18:28:18,255 INFO ]: Checked inductivity of 153 backedges. 53 proven. 17 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-26 18:28:18,276 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:28:18,276 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-26 18:28:18,276 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:28:18,276 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:28:18,276 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:28:18,276 INFO ]: Start difference. First operand 595 states and 1723 transitions. Second operand 16 states. [2018-06-26 18:28:21,126 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:21,126 INFO ]: Finished difference Result 1156 states and 4531 transitions. [2018-06-26 18:28:21,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-06-26 18:28:21,126 INFO ]: Start accepts. Automaton has 16 states. Word has length 55 [2018-06-26 18:28:21,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:21,200 INFO ]: With dead ends: 1156 [2018-06-26 18:28:21,200 INFO ]: Without dead ends: 1156 [2018-06-26 18:28:21,201 INFO ]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=563, Invalid=3859, Unknown=0, NotChecked=0, Total=4422 [2018-06-26 18:28:21,202 INFO ]: Start minimizeSevpa. Operand 1156 states. [2018-06-26 18:28:21,393 INFO ]: Finished minimizeSevpa. Reduced states from 1156 to 769. [2018-06-26 18:28:21,393 INFO ]: Start removeUnreachable. Operand 769 states. [2018-06-26 18:28:21,424 INFO ]: Finished removeUnreachable. Reduced from 769 states to 769 states and 2182 transitions. [2018-06-26 18:28:21,424 INFO ]: Start accepts. Automaton has 769 states and 2182 transitions. Word has length 55 [2018-06-26 18:28:21,424 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:21,424 INFO ]: Abstraction has 769 states and 2182 transitions. [2018-06-26 18:28:21,424 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:28:21,424 INFO ]: Start isEmpty. Operand 769 states and 2182 transitions. [2018-06-26 18:28:21,458 INFO ]: Finished isEmpty. Found accepting run of length 63 [2018-06-26 18:28:21,458 INFO ]: Found error trace [2018-06-26 18:28:21,458 INFO ]: trace histogram [11, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:21,458 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:21,458 INFO ]: Analyzing trace with hash -1315478015, now seen corresponding path program 1 times [2018-06-26 18:28:21,458 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:21,459 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:21,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:21,459 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:21,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:21,493 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:22,060 INFO ]: Checked inductivity of 198 backedges. 75 proven. 1 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-06-26 18:28:22,060 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:28:22,080 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) [2018-06-26 18:28:22,089 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:28:22,307 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:22,313 INFO ]: Computing forward predicates... [2018-06-26 18:28:22,345 INFO ]: Checked inductivity of 198 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-06-26 18:28:22,365 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:28:22,365 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-06-26 18:28:22,366 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:28:22,366 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:28:22,366 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:28:22,366 INFO ]: Start difference. First operand 769 states and 2182 transitions. Second operand 10 states. [2018-06-26 18:28:22,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:28:22,763 INFO ]: Finished difference Result 1957 states and 7374 transitions. [2018-06-26 18:28:22,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:28:22,763 INFO ]: Start accepts. Automaton has 10 states. Word has length 62 [2018-06-26 18:28:22,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:28:22,979 INFO ]: With dead ends: 1957 [2018-06-26 18:28:22,979 INFO ]: Without dead ends: 1066 [2018-06-26 18:28:22,979 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:28:22,980 INFO ]: Start minimizeSevpa. Operand 1066 states. [2018-06-26 18:28:23,108 INFO ]: Finished minimizeSevpa. Reduced states from 1066 to 731. [2018-06-26 18:28:23,108 INFO ]: Start removeUnreachable. Operand 731 states. [2018-06-26 18:28:23,134 INFO ]: Finished removeUnreachable. Reduced from 731 states to 731 states and 2071 transitions. [2018-06-26 18:28:23,134 INFO ]: Start accepts. Automaton has 731 states and 2071 transitions. Word has length 62 [2018-06-26 18:28:23,134 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:28:23,134 INFO ]: Abstraction has 731 states and 2071 transitions. [2018-06-26 18:28:23,134 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:28:23,134 INFO ]: Start isEmpty. Operand 731 states and 2071 transitions. [2018-06-26 18:28:23,175 INFO ]: Finished isEmpty. Found accepting run of length 63 [2018-06-26 18:28:23,176 INFO ]: Found error trace [2018-06-26 18:28:23,176 INFO ]: trace histogram [11, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:28:23,176 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:28:23,176 INFO ]: Analyzing trace with hash -304275982, now seen corresponding path program 1 times [2018-06-26 18:28:23,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:28:23,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:28:23,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:23,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:23,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:28:23,236 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:23,993 INFO ]: Checked inductivity of 200 backedges. 85 proven. 23 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-26 18:28:23,994 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:28:23,994 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:24,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:28:24,191 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:28:24,197 INFO ]: Computing forward predicates... [2018-06-26 18:28:24,348 INFO ]: Checked inductivity of 200 backedges. 80 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-06-26 18:28:24,368 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:28:24,368 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-06-26 18:28:24,368 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:28:24,368 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:28:24,368 INFO ]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:28:24,369 INFO ]: Start difference. First operand 731 states and 2071 transitions. Second operand 19 states. Received shutdown request... [2018-06-26 18:28:27,350 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-06-26 18:28:27,350 WARN ]: Verification canceled [2018-06-26 18:28:27,352 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:28:27,353 WARN ]: Timeout [2018-06-26 18:28:27,353 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:28:27 BasicIcfg [2018-06-26 18:28:27,353 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:28:27,354 INFO ]: Toolchain (without parser) took 55248.73 ms. Allocated memory was 308.8 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 237.4 MB in the beginning and 217.1 MB in the end (delta: 20.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 3.6 GB. [2018-06-26 18:28:27,356 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:28:27,356 INFO ]: ChcToBoogie took 79.33 ms. Allocated memory is still 308.8 MB. Free memory was 237.4 MB in the beginning and 233.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:28:27,356 INFO ]: Boogie Preprocessor took 58.79 ms. Allocated memory is still 308.8 MB. Free memory was 233.4 MB in the beginning and 231.4 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:28:27,357 INFO ]: RCFGBuilder took 924.27 ms. Allocated memory was 308.8 MB in the beginning and 324.5 MB in the end (delta: 15.7 MB). Free memory was 231.4 MB in the beginning and 292.7 MB in the end (delta: -61.2 MB). Peak memory consumption was 49.6 MB. Max. memory is 3.6 GB. [2018-06-26 18:28:27,357 INFO ]: BlockEncodingV2 took 3292.03 ms. Allocated memory was 324.5 MB in the beginning and 392.7 MB in the end (delta: 68.2 MB). Free memory was 292.7 MB in the beginning and 282.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 177.3 MB. Max. memory is 3.6 GB. [2018-06-26 18:28:27,358 INFO ]: TraceAbstraction took 50886.03 ms. Allocated memory was 392.7 MB in the beginning and 1.3 GB in the end (delta: 926.9 MB). Free memory was 282.6 MB in the beginning and 217.1 MB in the end (delta: 65.5 MB). Peak memory consumption was 992.5 MB. Max. memory is 3.6 GB. [2018-06-26 18:28:27,363 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 49 locations, 79 edges - StatisticsResult: Encoded RCFG 31 locations, 118 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 79.33 ms. Allocated memory is still 308.8 MB. Free memory was 237.4 MB in the beginning and 233.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 58.79 ms. Allocated memory is still 308.8 MB. Free memory was 233.4 MB in the beginning and 231.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 924.27 ms. Allocated memory was 308.8 MB in the beginning and 324.5 MB in the end (delta: 15.7 MB). Free memory was 231.4 MB in the beginning and 292.7 MB in the end (delta: -61.2 MB). Peak memory consumption was 49.6 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 3292.03 ms. Allocated memory was 324.5 MB in the beginning and 392.7 MB in the end (delta: 68.2 MB). Free memory was 292.7 MB in the beginning and 282.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 177.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 50886.03 ms. Allocated memory was 392.7 MB in the beginning and 1.3 GB in the end (delta: 926.9 MB). Free memory was 282.6 MB in the beginning and 217.1 MB in the end (delta: 65.5 MB). Peak memory consumption was 992.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (731states) and interpolant automaton (currently 108 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 121 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. TIMEOUT Result, 50.8s OverallTime, 17 OverallIterations, 11 TraceHistogramMax, 39.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2375 SDtfs, 2600 SDslu, 10407 SDs, 0 SdLazy, 33224 SolverSat, 4324 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1282 GetRequests, 603 SyntacticMatches, 1 SemanticMatches, 677 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36762 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=769occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 3834 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 916 NumberOfCodeBlocks, 916 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 890 ConstructedInterpolants, 0 QuantifiedInterpolants, 75213 SizeOfPredicates, 67 NumberOfNonLiveVariables, 12784 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 26 InterpolantComputations, 10 PerfectInterpolantSequences, 2188/2307 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann04.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-28-27-377.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann04.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-28-27-377.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann04.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-28-27-377.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann04.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-28-27-377.csv Completed graceful shutdown