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/eldarica-misc/LIA/reve/005b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:59:46,033 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:59:46,035 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:59:46,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:59:46,047 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:59:46,048 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:59:46,051 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:59:46,052 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:59:46,054 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:59:46,054 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:59:46,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:59:46,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:59:46,056 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:59:46,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:59:46,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:59:46,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:59:46,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:59:46,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:59:46,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:59:46,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:59:46,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:59:46,067 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:59:46,069 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:59:46,070 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:59:46,070 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:59:46,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:59:46,072 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:59:46,073 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:59:46,073 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:59:46,074 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:59:46,075 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:59:46,075 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:59:46,076 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:59:46,076 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:59:46,077 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:59:46,077 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:59:46,078 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:59:46,092 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:59:46,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:59:46,092 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:59:46,093 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:59:46,094 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:59:46,094 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:59:46,094 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:59:46,094 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:59:46,094 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:59:46,095 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:59:46,095 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:59:46,095 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:59:46,095 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:59:46,096 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:59:46,096 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:59:46,096 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:59:46,096 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:59:46,096 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:59:46,097 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:59:46,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:59:46,097 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:59:46,099 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:59:46,099 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:59:46,143 INFO ]: Repository-Root is: /tmp [2018-06-26 17:59:46,158 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:59:46,165 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:59:46,167 INFO ]: Initializing SmtParser... [2018-06-26 17:59:46,167 INFO ]: SmtParser initialized [2018-06-26 17:59:46,168 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 [2018-06-26 17:59:46,169 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 17:59:46,259 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 unknown [2018-06-26 17:59:46,484 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 [2018-06-26 17:59:46,488 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:59:46,495 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:59:46,495 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:59:46,495 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:59:46,496 INFO ]: ChcToBoogie initialized [2018-06-26 17:59:46,499 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:59:46" (1/1) ... [2018-06-26 17:59:46,555 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:59:46 Unit [2018-06-26 17:59:46,556 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:59:46,556 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:59:46,556 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:59:46,556 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:59:46,575 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:59:46" (1/1) ... [2018-06-26 17:59:46,575 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:59:46" (1/1) ... [2018-06-26 17:59:46,580 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:59:46" (1/1) ... [2018-06-26 17:59:46,580 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:59:46" (1/1) ... [2018-06-26 17:59:46,583 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:59:46" (1/1) ... [2018-06-26 17:59:46,585 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:59:46" (1/1) ... [2018-06-26 17:59:46,586 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:59:46" (1/1) ... [2018-06-26 17:59:46,587 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:59:46,588 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:59:46,588 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:59:46,588 INFO ]: RCFGBuilder initialized [2018-06-26 17:59:46,593 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:59:46" (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 17:59:46,608 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:59:46,608 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:59:46,608 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:59:46,608 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:59:46,608 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:59:46,608 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 17:59:47,018 INFO ]: Using library mode [2018-06-26 17:59:47,019 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:59:47 BoogieIcfgContainer [2018-06-26 17:59:47,019 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:59:47,019 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:59:47,020 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:59:47,020 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:59:47,021 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:59:47" (1/1) ... [2018-06-26 17:59:47,037 INFO ]: Initial Icfg 20 locations, 30 edges [2018-06-26 17:59:47,038 INFO ]: Using Remove infeasible edges [2018-06-26 17:59:47,039 INFO ]: Using Maximize final states [2018-06-26 17:59:47,039 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:59:47,039 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:59:47,041 INFO ]: Using Remove sink states [2018-06-26 17:59:47,042 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:59:47,042 INFO ]: Using Use SBE [2018-06-26 17:59:47,048 INFO ]: SBE split 0 edges [2018-06-26 17:59:47,053 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 17:59:47,054 INFO ]: 0 new accepting states [2018-06-26 17:59:47,097 INFO ]: Removed 7 edges and 3 locations by large block encoding [2018-06-26 17:59:47,099 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:59:47,101 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:59:47,101 INFO ]: 0 new accepting states [2018-06-26 17:59:47,101 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:59:47,102 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:59:47,102 INFO ]: Encoded RCFG 15 locations, 25 edges [2018-06-26 17:59:47,102 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:59:47 BasicIcfg [2018-06-26 17:59:47,102 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:59:47,104 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:59:47,104 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:59:47,107 INFO ]: TraceAbstraction initialized [2018-06-26 17:59:47,107 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:59:46" (1/4) ... [2018-06-26 17:59:47,108 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5cee10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:59:47, skipping insertion in model container [2018-06-26 17:59:47,108 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:59:46" (2/4) ... [2018-06-26 17:59:47,108 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5cee10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:59:47, skipping insertion in model container [2018-06-26 17:59:47,108 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:59:47" (3/4) ... [2018-06-26 17:59:47,108 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5cee10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:59:47, skipping insertion in model container [2018-06-26 17:59:47,108 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:59:47" (4/4) ... [2018-06-26 17:59:47,110 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:59:47,121 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:59:47,138 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:59:47,174 INFO ]: Using default assertion order modulation [2018-06-26 17:59:47,174 INFO ]: Interprodecural is true [2018-06-26 17:59:47,174 INFO ]: Hoare is false [2018-06-26 17:59:47,174 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:59:47,174 INFO ]: Backedges is TWOTRACK [2018-06-26 17:59:47,174 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:59:47,174 INFO ]: Difference is false [2018-06-26 17:59:47,174 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:59:47,174 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:59:47,183 INFO ]: Start isEmpty. Operand 15 states. [2018-06-26 17:59:47,192 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:59:47,192 INFO ]: Found error trace [2018-06-26 17:59:47,193 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:59:47,193 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:47,198 INFO ]: Analyzing trace with hash 34173120, now seen corresponding path program 1 times [2018-06-26 17:59:47,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:47,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:47,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:47,232 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:47,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:47,283 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:47,336 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:47,338 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:59:47,338 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:59:47,339 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:59:47,350 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:59:47,351 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:59:47,353 INFO ]: Start difference. First operand 15 states. Second operand 3 states. [2018-06-26 17:59:47,595 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:47,596 INFO ]: Finished difference Result 27 states and 47 transitions. [2018-06-26 17:59:47,596 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:59:47,597 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:59:47,597 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:47,606 INFO ]: With dead ends: 27 [2018-06-26 17:59:47,606 INFO ]: Without dead ends: 27 [2018-06-26 17:59:47,607 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 17:59:47,620 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 17:59:47,641 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-26 17:59:47,642 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 17:59:47,644 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2018-06-26 17:59:47,646 INFO ]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 5 [2018-06-26 17:59:47,647 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:47,647 INFO ]: Abstraction has 27 states and 47 transitions. [2018-06-26 17:59:47,647 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:59:47,647 INFO ]: Start isEmpty. Operand 27 states and 47 transitions. [2018-06-26 17:59:47,650 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:59:47,650 INFO ]: Found error trace [2018-06-26 17:59:47,650 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:47,650 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:47,650 INFO ]: Analyzing trace with hash -620241774, now seen corresponding path program 1 times [2018-06-26 17:59:47,650 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:47,650 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:47,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:47,651 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:47,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:47,685 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:47,841 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:59:47,841 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:59:47,841 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:59:47,842 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:59:47,843 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:59:47,843 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:59:47,843 INFO ]: Start difference. First operand 27 states and 47 transitions. Second operand 5 states. [2018-06-26 17:59:48,038 WARN ]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-26 17:59:48,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:48,207 INFO ]: Finished difference Result 47 states and 102 transitions. [2018-06-26 17:59:48,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:59:48,208 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-26 17:59:48,208 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:48,213 INFO ]: With dead ends: 47 [2018-06-26 17:59:48,213 INFO ]: Without dead ends: 47 [2018-06-26 17:59:48,214 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:59:48,214 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-26 17:59:48,228 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 31. [2018-06-26 17:59:48,229 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:59:48,230 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 61 transitions. [2018-06-26 17:59:48,230 INFO ]: Start accepts. Automaton has 31 states and 61 transitions. Word has length 11 [2018-06-26 17:59:48,231 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:48,231 INFO ]: Abstraction has 31 states and 61 transitions. [2018-06-26 17:59:48,231 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:59:48,231 INFO ]: Start isEmpty. Operand 31 states and 61 transitions. [2018-06-26 17:59:48,233 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:59:48,233 INFO ]: Found error trace [2018-06-26 17:59:48,233 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:48,233 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:48,234 INFO ]: Analyzing trace with hash -2048068592, now seen corresponding path program 1 times [2018-06-26 17:59:48,234 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:48,234 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:48,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:48,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:48,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:48,255 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:48,430 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:59:48,430 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:48,430 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 17:59:48,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:48,511 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:48,519 INFO ]: Computing forward predicates... [2018-06-26 17:59:48,551 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:59:48,580 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:48,580 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 17:59:48,581 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:59:48,581 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:59:48,581 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:59:48,581 INFO ]: Start difference. First operand 31 states and 61 transitions. Second operand 6 states. [2018-06-26 17:59:48,751 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:48,751 INFO ]: Finished difference Result 47 states and 108 transitions. [2018-06-26 17:59:48,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:59:48,752 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-26 17:59:48,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:48,754 INFO ]: With dead ends: 47 [2018-06-26 17:59:48,754 INFO ]: Without dead ends: 45 [2018-06-26 17:59:48,754 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:59:48,754 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-26 17:59:48,764 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 35. [2018-06-26 17:59:48,764 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 17:59:48,765 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 69 transitions. [2018-06-26 17:59:48,765 INFO ]: Start accepts. Automaton has 35 states and 69 transitions. Word has length 12 [2018-06-26 17:59:48,765 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:48,765 INFO ]: Abstraction has 35 states and 69 transitions. [2018-06-26 17:59:48,766 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:59:48,766 INFO ]: Start isEmpty. Operand 35 states and 69 transitions. [2018-06-26 17:59:48,767 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:59:48,767 INFO ]: Found error trace [2018-06-26 17:59:48,767 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:48,767 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:48,767 INFO ]: Analyzing trace with hash -2048038801, now seen corresponding path program 1 times [2018-06-26 17:59:48,767 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:48,768 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:48,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:48,768 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:48,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:48,786 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:49,064 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:59:49,064 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:49,098 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:59:49,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:49,155 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:49,161 INFO ]: Computing forward predicates... [2018-06-26 17:59:49,216 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:59:49,252 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:49,252 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 17:59:49,253 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:59:49,253 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:59:49,253 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:59:49,253 INFO ]: Start difference. First operand 35 states and 69 transitions. Second operand 6 states. [2018-06-26 17:59:49,706 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:49,706 INFO ]: Finished difference Result 53 states and 118 transitions. [2018-06-26 17:59:49,707 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:59:49,707 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-26 17:59:49,707 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:49,709 INFO ]: With dead ends: 53 [2018-06-26 17:59:49,709 INFO ]: Without dead ends: 47 [2018-06-26 17:59:49,709 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:59:49,709 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-26 17:59:49,717 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-06-26 17:59:49,717 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 17:59:49,718 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 77 transitions. [2018-06-26 17:59:49,718 INFO ]: Start accepts. Automaton has 37 states and 77 transitions. Word has length 12 [2018-06-26 17:59:49,718 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:49,718 INFO ]: Abstraction has 37 states and 77 transitions. [2018-06-26 17:59:49,718 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:59:49,718 INFO ]: Start isEmpty. Operand 37 states and 77 transitions. [2018-06-26 17:59:49,720 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:59:49,720 INFO ]: Found error trace [2018-06-26 17:59:49,720 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:49,721 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:49,721 INFO ]: Analyzing trace with hash 1203824412, now seen corresponding path program 1 times [2018-06-26 17:59:49,721 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:49,721 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:49,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:49,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:49,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:49,766 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:50,014 INFO ]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 17:59:50,014 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:50,015 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 17:59:50,028 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:50,062 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:50,064 INFO ]: Computing forward predicates... [2018-06-26 17:59:50,098 INFO ]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 17:59:50,117 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:50,117 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-26 17:59:50,118 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:59:50,118 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:59:50,118 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:59:50,118 INFO ]: Start difference. First operand 37 states and 77 transitions. Second operand 10 states. [2018-06-26 17:59:50,420 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:50,421 INFO ]: Finished difference Result 69 states and 148 transitions. [2018-06-26 17:59:50,421 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:59:50,421 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-26 17:59:50,421 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:50,424 INFO ]: With dead ends: 69 [2018-06-26 17:59:50,424 INFO ]: Without dead ends: 69 [2018-06-26 17:59:50,424 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:59:50,424 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-26 17:59:50,435 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 45. [2018-06-26 17:59:50,435 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-26 17:59:50,437 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 93 transitions. [2018-06-26 17:59:50,437 INFO ]: Start accepts. Automaton has 45 states and 93 transitions. Word has length 17 [2018-06-26 17:59:50,437 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:50,437 INFO ]: Abstraction has 45 states and 93 transitions. [2018-06-26 17:59:50,437 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:59:50,437 INFO ]: Start isEmpty. Operand 45 states and 93 transitions. [2018-06-26 17:59:50,439 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:59:50,439 INFO ]: Found error trace [2018-06-26 17:59:50,439 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:50,439 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:50,440 INFO ]: Analyzing trace with hash 1103913763, now seen corresponding path program 1 times [2018-06-26 17:59:50,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:50,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:50,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:50,440 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:50,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:50,457 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:50,507 INFO ]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 17:59:50,507 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:59:50,507 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:59:50,507 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:59:50,507 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:59:50,507 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:59:50,507 INFO ]: Start difference. First operand 45 states and 93 transitions. Second operand 5 states. [2018-06-26 17:59:50,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:50,603 INFO ]: Finished difference Result 57 states and 120 transitions. [2018-06-26 17:59:50,604 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:59:50,604 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-26 17:59:50,604 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:50,606 INFO ]: With dead ends: 57 [2018-06-26 17:59:50,606 INFO ]: Without dead ends: 57 [2018-06-26 17:59:50,606 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:59:50,606 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-26 17:59:50,614 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 47. [2018-06-26 17:59:50,614 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-26 17:59:50,615 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 93 transitions. [2018-06-26 17:59:50,615 INFO ]: Start accepts. Automaton has 47 states and 93 transitions. Word has length 17 [2018-06-26 17:59:50,616 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:50,616 INFO ]: Abstraction has 47 states and 93 transitions. [2018-06-26 17:59:50,616 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:59:50,616 INFO ]: Start isEmpty. Operand 47 states and 93 transitions. [2018-06-26 17:59:50,617 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:59:50,617 INFO ]: Found error trace [2018-06-26 17:59:50,618 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:50,618 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:50,618 INFO ]: Analyzing trace with hash -932010591, now seen corresponding path program 1 times [2018-06-26 17:59:50,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:50,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:50,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:50,618 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:50,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:50,635 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:50,690 INFO ]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 17:59:50,691 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:59:50,691 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:59:50,691 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:59:50,691 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:59:50,691 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:59:50,691 INFO ]: Start difference. First operand 47 states and 93 transitions. Second operand 5 states. [2018-06-26 17:59:50,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:50,769 INFO ]: Finished difference Result 60 states and 128 transitions. [2018-06-26 17:59:50,769 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:59:50,769 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-26 17:59:50,769 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:50,771 INFO ]: With dead ends: 60 [2018-06-26 17:59:50,771 INFO ]: Without dead ends: 60 [2018-06-26 17:59:50,771 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:59:50,771 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-26 17:59:50,781 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 49. [2018-06-26 17:59:50,782 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-26 17:59:50,783 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 97 transitions. [2018-06-26 17:59:50,783 INFO ]: Start accepts. Automaton has 49 states and 97 transitions. Word has length 17 [2018-06-26 17:59:50,783 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:50,783 INFO ]: Abstraction has 49 states and 97 transitions. [2018-06-26 17:59:50,783 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:59:50,783 INFO ]: Start isEmpty. Operand 49 states and 97 transitions. [2018-06-26 17:59:50,785 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:59:50,785 INFO ]: Found error trace [2018-06-26 17:59:50,785 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:50,785 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:50,785 INFO ]: Analyzing trace with hash -1336532092, now seen corresponding path program 1 times [2018-06-26 17:59:50,785 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:50,785 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:50,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:50,786 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:50,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:50,803 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:50,870 INFO ]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-26 17:59:50,870 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:59:50,870 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:59:50,870 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:59:50,871 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:59:50,871 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:59:50,871 INFO ]: Start difference. First operand 49 states and 97 transitions. Second operand 3 states. [2018-06-26 17:59:50,904 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:50,904 INFO ]: Finished difference Result 55 states and 107 transitions. [2018-06-26 17:59:50,905 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:59:50,905 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 17:59:50,905 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:50,906 INFO ]: With dead ends: 55 [2018-06-26 17:59:50,906 INFO ]: Without dead ends: 47 [2018-06-26 17:59:50,906 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 17:59:50,906 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-26 17:59:50,912 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-26 17:59:50,912 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-26 17:59:50,913 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 87 transitions. [2018-06-26 17:59:50,913 INFO ]: Start accepts. Automaton has 47 states and 87 transitions. Word has length 18 [2018-06-26 17:59:50,913 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:50,913 INFO ]: Abstraction has 47 states and 87 transitions. [2018-06-26 17:59:50,913 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:59:50,913 INFO ]: Start isEmpty. Operand 47 states and 87 transitions. [2018-06-26 17:59:50,914 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:59:50,915 INFO ]: Found error trace [2018-06-26 17:59:50,915 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:50,915 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:50,915 INFO ]: Analyzing trace with hash -138824706, now seen corresponding path program 1 times [2018-06-26 17:59:50,915 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:50,915 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:50,916 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:50,916 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:50,916 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:50,930 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:51,035 INFO ]: Checked inductivity of 13 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 17:59:51,035 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:51,035 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 17:59:51,041 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:51,090 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:51,093 INFO ]: Computing forward predicates... [2018-06-26 17:59:51,252 INFO ]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:59:51,275 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:59:51,275 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 9 [2018-06-26 17:59:51,275 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:59:51,275 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:59:51,275 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:59:51,276 INFO ]: Start difference. First operand 47 states and 87 transitions. Second operand 9 states. [2018-06-26 17:59:51,743 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:51,743 INFO ]: Finished difference Result 59 states and 103 transitions. [2018-06-26 17:59:51,744 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:59:51,744 INFO ]: Start accepts. Automaton has 9 states. Word has length 18 [2018-06-26 17:59:51,744 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:51,744 INFO ]: With dead ends: 59 [2018-06-26 17:59:51,744 INFO ]: Without dead ends: 55 [2018-06-26 17:59:51,745 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:59:51,745 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-26 17:59:51,749 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 43. [2018-06-26 17:59:51,749 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 17:59:51,750 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 79 transitions. [2018-06-26 17:59:51,750 INFO ]: Start accepts. Automaton has 43 states and 79 transitions. Word has length 18 [2018-06-26 17:59:51,750 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:51,750 INFO ]: Abstraction has 43 states and 79 transitions. [2018-06-26 17:59:51,750 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:59:51,750 INFO ]: Start isEmpty. Operand 43 states and 79 transitions. [2018-06-26 17:59:51,751 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:59:51,751 INFO ]: Found error trace [2018-06-26 17:59:51,751 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:51,752 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:51,752 INFO ]: Analyzing trace with hash 1171999969, now seen corresponding path program 1 times [2018-06-26 17:59:51,752 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:51,752 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:51,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:51,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:51,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:51,765 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:51,846 INFO ]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 17:59:51,846 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:51,846 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:59:51,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:51,899 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:51,901 INFO ]: Computing forward predicates... [2018-06-26 17:59:52,097 INFO ]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 17:59:52,120 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:52,120 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-26 17:59:52,120 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:59:52,120 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:59:52,120 INFO ]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:59:52,120 INFO ]: Start difference. First operand 43 states and 79 transitions. Second operand 15 states. [2018-06-26 17:59:53,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:53,629 INFO ]: Finished difference Result 122 states and 331 transitions. [2018-06-26 17:59:53,634 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-26 17:59:53,634 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-26 17:59:53,635 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:53,637 INFO ]: With dead ends: 122 [2018-06-26 17:59:53,637 INFO ]: Without dead ends: 113 [2018-06-26 17:59:53,637 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=305, Invalid=1857, Unknown=0, NotChecked=0, Total=2162 [2018-06-26 17:59:53,638 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-26 17:59:53,658 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 83. [2018-06-26 17:59:53,659 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-26 17:59:53,660 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 175 transitions. [2018-06-26 17:59:53,660 INFO ]: Start accepts. Automaton has 83 states and 175 transitions. Word has length 18 [2018-06-26 17:59:53,661 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:53,661 INFO ]: Abstraction has 83 states and 175 transitions. [2018-06-26 17:59:53,661 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:59:53,661 INFO ]: Start isEmpty. Operand 83 states and 175 transitions. [2018-06-26 17:59:53,663 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:59:53,663 INFO ]: Found error trace [2018-06-26 17:59:53,663 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:53,663 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:53,663 INFO ]: Analyzing trace with hash 1172029760, now seen corresponding path program 1 times [2018-06-26 17:59:53,663 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:53,663 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:53,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:53,664 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:53,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:53,679 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:53,772 INFO ]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-26 17:59:53,772 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:59:53,772 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:59:53,772 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:59:53,772 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:59:53,772 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:59:53,772 INFO ]: Start difference. First operand 83 states and 175 transitions. Second operand 3 states. [2018-06-26 17:59:53,854 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:53,854 INFO ]: Finished difference Result 85 states and 177 transitions. [2018-06-26 17:59:53,854 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:59:53,854 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 17:59:53,854 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:53,856 INFO ]: With dead ends: 85 [2018-06-26 17:59:53,856 INFO ]: Without dead ends: 67 [2018-06-26 17:59:53,856 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 17:59:53,856 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-26 17:59:53,863 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-06-26 17:59:53,863 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-26 17:59:53,864 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 124 transitions. [2018-06-26 17:59:53,864 INFO ]: Start accepts. Automaton has 67 states and 124 transitions. Word has length 18 [2018-06-26 17:59:53,865 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:53,865 INFO ]: Abstraction has 67 states and 124 transitions. [2018-06-26 17:59:53,865 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:59:53,865 INFO ]: Start isEmpty. Operand 67 states and 124 transitions. [2018-06-26 17:59:53,867 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:59:53,867 INFO ]: Found error trace [2018-06-26 17:59:53,867 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:53,867 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:53,867 INFO ]: Analyzing trace with hash 136733222, now seen corresponding path program 2 times [2018-06-26 17:59:53,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:53,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:53,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:53,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:53,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:53,881 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:53,963 INFO ]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 17:59:53,963 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:59:53,963 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-26 17:59:53,963 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:59:53,963 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:59:53,963 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:59:53,963 INFO ]: Start difference. First operand 67 states and 124 transitions. Second operand 7 states. [2018-06-26 17:59:54,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:54,103 INFO ]: Finished difference Result 83 states and 150 transitions. [2018-06-26 17:59:54,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:59:54,132 INFO ]: Start accepts. Automaton has 7 states. Word has length 23 [2018-06-26 17:59:54,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:54,133 INFO ]: With dead ends: 83 [2018-06-26 17:59:54,133 INFO ]: Without dead ends: 61 [2018-06-26 17:59:54,133 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:59:54,133 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-26 17:59:54,138 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 43. [2018-06-26 17:59:54,139 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 17:59:54,139 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 76 transitions. [2018-06-26 17:59:54,139 INFO ]: Start accepts. Automaton has 43 states and 76 transitions. Word has length 23 [2018-06-26 17:59:54,139 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:54,139 INFO ]: Abstraction has 43 states and 76 transitions. [2018-06-26 17:59:54,139 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:59:54,140 INFO ]: Start isEmpty. Operand 43 states and 76 transitions. [2018-06-26 17:59:54,141 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:59:54,141 INFO ]: Found error trace [2018-06-26 17:59:54,141 INFO ]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:54,141 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:54,141 INFO ]: Analyzing trace with hash 4314087, now seen corresponding path program 1 times [2018-06-26 17:59:54,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:54,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:54,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:54,142 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:54,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:54,170 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:54,345 INFO ]: Checked inductivity of 30 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-26 17:59:54,345 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:54,345 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 17:59:54,351 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:54,401 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:54,405 INFO ]: Computing forward predicates... [2018-06-26 17:59:54,497 INFO ]: Checked inductivity of 30 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-26 17:59:54,517 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:54,517 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-06-26 17:59:54,517 INFO ]: Interpolant automaton has 17 states [2018-06-26 17:59:54,517 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 17:59:54,517 INFO ]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:59:54,517 INFO ]: Start difference. First operand 43 states and 76 transitions. Second operand 17 states. [2018-06-26 17:59:56,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:56,093 INFO ]: Finished difference Result 124 states and 269 transitions. [2018-06-26 17:59:56,093 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 17:59:56,093 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-26 17:59:56,093 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:56,095 INFO ]: With dead ends: 124 [2018-06-26 17:59:56,095 INFO ]: Without dead ends: 124 [2018-06-26 17:59:56,096 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:59:56,096 INFO ]: Start minimizeSevpa. Operand 124 states. [2018-06-26 17:59:56,109 INFO ]: Finished minimizeSevpa. Reduced states from 124 to 108. [2018-06-26 17:59:56,109 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-26 17:59:56,111 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 224 transitions. [2018-06-26 17:59:56,111 INFO ]: Start accepts. Automaton has 108 states and 224 transitions. Word has length 25 [2018-06-26 17:59:56,111 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:56,111 INFO ]: Abstraction has 108 states and 224 transitions. [2018-06-26 17:59:56,111 INFO ]: Interpolant automaton has 17 states. [2018-06-26 17:59:56,111 INFO ]: Start isEmpty. Operand 108 states and 224 transitions. [2018-06-26 17:59:56,113 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:59:56,113 INFO ]: Found error trace [2018-06-26 17:59:56,113 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:56,113 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:56,113 INFO ]: Analyzing trace with hash -1648712254, now seen corresponding path program 2 times [2018-06-26 17:59:56,113 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:56,113 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:56,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:56,114 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:56,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:56,129 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:56,273 INFO ]: Checked inductivity of 32 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 17:59:56,273 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:56,273 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 17:59:56,279 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:59:56,349 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:59:56,349 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:56,352 INFO ]: Computing forward predicates... [2018-06-26 17:59:56,511 INFO ]: Checked inductivity of 32 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 17:59:56,541 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:56,541 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-26 17:59:56,541 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:59:56,542 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:59:56,542 INFO ]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:59:56,542 INFO ]: Start difference. First operand 108 states and 224 transitions. Second operand 19 states. [2018-06-26 17:59:58,478 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:58,478 INFO ]: Finished difference Result 142 states and 296 transitions. [2018-06-26 17:59:58,478 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 17:59:58,478 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-26 17:59:58,478 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:58,480 INFO ]: With dead ends: 142 [2018-06-26 17:59:58,480 INFO ]: Without dead ends: 141 [2018-06-26 17:59:58,481 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=1488, Unknown=0, NotChecked=0, Total=1722 [2018-06-26 17:59:58,481 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-26 17:59:58,492 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 107. [2018-06-26 17:59:58,492 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-26 17:59:58,497 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 217 transitions. [2018-06-26 17:59:58,497 INFO ]: Start accepts. Automaton has 107 states and 217 transitions. Word has length 25 [2018-06-26 17:59:58,497 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:58,497 INFO ]: Abstraction has 107 states and 217 transitions. [2018-06-26 17:59:58,497 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:59:58,497 INFO ]: Start isEmpty. Operand 107 states and 217 transitions. [2018-06-26 17:59:58,498 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:59:58,498 INFO ]: Found error trace [2018-06-26 17:59:58,498 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:58,499 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:58,499 INFO ]: Analyzing trace with hash 402172697, now seen corresponding path program 2 times [2018-06-26 17:59:58,499 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:58,499 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:58,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:58,499 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:58,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:58,525 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:58,748 INFO ]: Checked inductivity of 43 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-26 17:59:58,748 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:58,748 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 17:59:58,755 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:59:58,795 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:59:58,795 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:58,799 INFO ]: Computing forward predicates... [2018-06-26 17:59:59,008 INFO ]: Checked inductivity of 43 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-26 17:59:59,040 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:59,040 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 17:59:59,040 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:59:59,040 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:59:59,040 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:59:59,040 INFO ]: Start difference. First operand 107 states and 217 transitions. Second operand 9 states. [2018-06-26 17:59:59,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:59,294 INFO ]: Finished difference Result 209 states and 442 transitions. [2018-06-26 17:59:59,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:59:59,321 INFO ]: Start accepts. Automaton has 9 states. Word has length 27 [2018-06-26 17:59:59,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:59,325 INFO ]: With dead ends: 209 [2018-06-26 17:59:59,326 INFO ]: Without dead ends: 203 [2018-06-26 17:59:59,326 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:59:59,326 INFO ]: Start minimizeSevpa. Operand 203 states. [2018-06-26 17:59:59,339 INFO ]: Finished minimizeSevpa. Reduced states from 203 to 125. [2018-06-26 17:59:59,339 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-26 17:59:59,341 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 256 transitions. [2018-06-26 17:59:59,341 INFO ]: Start accepts. Automaton has 125 states and 256 transitions. Word has length 27 [2018-06-26 17:59:59,341 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:59,341 INFO ]: Abstraction has 125 states and 256 transitions. [2018-06-26 17:59:59,342 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:59:59,342 INFO ]: Start isEmpty. Operand 125 states and 256 transitions. [2018-06-26 17:59:59,343 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:59:59,343 INFO ]: Found error trace [2018-06-26 17:59:59,343 INFO ]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:59,343 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:59,343 INFO ]: Analyzing trace with hash -1347217408, now seen corresponding path program 3 times [2018-06-26 17:59:59,343 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:59,343 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:59,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:59,344 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:59,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:59,359 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:59,911 INFO ]: Checked inductivity of 45 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-26 17:59:59,912 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:59,912 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 17:59:59,921 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:59:59,962 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 17:59:59,962 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:59,965 INFO ]: Computing forward predicates... [2018-06-26 17:59:59,985 INFO ]: Checked inductivity of 45 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-26 18:00:00,004 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:00:00,005 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-26 18:00:00,005 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:00:00,005 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:00:00,005 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:00:00,006 INFO ]: Start difference. First operand 125 states and 256 transitions. Second operand 10 states. [2018-06-26 18:00:00,102 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:00:00,102 INFO ]: Finished difference Result 191 states and 452 transitions. [2018-06-26 18:00:00,102 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:00:00,102 INFO ]: Start accepts. Automaton has 10 states. Word has length 27 [2018-06-26 18:00:00,102 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:00:00,108 INFO ]: With dead ends: 191 [2018-06-26 18:00:00,108 INFO ]: Without dead ends: 191 [2018-06-26 18:00:00,108 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:00:00,108 INFO ]: Start minimizeSevpa. Operand 191 states. [2018-06-26 18:00:00,124 INFO ]: Finished minimizeSevpa. Reduced states from 191 to 146. [2018-06-26 18:00:00,124 INFO ]: Start removeUnreachable. Operand 146 states. [2018-06-26 18:00:00,126 INFO ]: Finished removeUnreachable. Reduced from 146 states to 146 states and 304 transitions. [2018-06-26 18:00:00,126 INFO ]: Start accepts. Automaton has 146 states and 304 transitions. Word has length 27 [2018-06-26 18:00:00,127 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:00:00,127 INFO ]: Abstraction has 146 states and 304 transitions. [2018-06-26 18:00:00,127 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:00:00,127 INFO ]: Start isEmpty. Operand 146 states and 304 transitions. [2018-06-26 18:00:00,131 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 18:00:00,131 INFO ]: Found error trace [2018-06-26 18:00:00,131 INFO ]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:00:00,131 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:00:00,131 INFO ]: Analyzing trace with hash 1185490530, now seen corresponding path program 4 times [2018-06-26 18:00:00,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:00:00,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:00:00,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:00,132 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:00:00,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:00,152 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:00,312 INFO ]: Checked inductivity of 53 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-26 18:00:00,312 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:00:00,312 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:00:00,317 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:00:00,379 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:00:00,379 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:00,382 INFO ]: Computing forward predicates... [2018-06-26 18:00:00,396 INFO ]: Checked inductivity of 53 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-26 18:00:00,426 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:00:00,426 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 18:00:00,426 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:00:00,426 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:00:00,426 INFO ]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:00:00,426 INFO ]: Start difference. First operand 146 states and 304 transitions. Second operand 11 states. [2018-06-26 18:00:01,664 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:00:01,664 INFO ]: Finished difference Result 203 states and 424 transitions. [2018-06-26 18:00:01,665 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 18:00:01,665 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-26 18:00:01,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:00:01,670 INFO ]: With dead ends: 203 [2018-06-26 18:00:01,670 INFO ]: Without dead ends: 194 [2018-06-26 18:00:01,670 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:00:01,671 INFO ]: Start minimizeSevpa. Operand 194 states. [2018-06-26 18:00:01,688 INFO ]: Finished minimizeSevpa. Reduced states from 194 to 164. [2018-06-26 18:00:01,688 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-26 18:00:01,690 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 343 transitions. [2018-06-26 18:00:01,690 INFO ]: Start accepts. Automaton has 164 states and 343 transitions. Word has length 28 [2018-06-26 18:00:01,690 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:00:01,690 INFO ]: Abstraction has 164 states and 343 transitions. [2018-06-26 18:00:01,690 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:00:01,690 INFO ]: Start isEmpty. Operand 164 states and 343 transitions. [2018-06-26 18:00:01,692 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 18:00:01,692 INFO ]: Found error trace [2018-06-26 18:00:01,692 INFO ]: trace histogram [5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:00:01,692 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:00:01,692 INFO ]: Analyzing trace with hash -1587459617, now seen corresponding path program 3 times [2018-06-26 18:00:01,692 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:00:01,692 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:00:01,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:01,693 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:00:01,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:01,710 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:02,679 INFO ]: Checked inductivity of 73 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-06-26 18:00:02,679 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:00:02,679 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 18:00:02,693 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:00:02,823 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-26 18:00:02,823 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:02,828 INFO ]: Computing forward predicates... [2018-06-26 18:00:03,041 INFO ]: Checked inductivity of 73 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:00:03,062 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:00:03,062 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 18 [2018-06-26 18:00:03,062 INFO ]: Interpolant automaton has 18 states [2018-06-26 18:00:03,062 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 18:00:03,062 INFO ]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:00:03,063 INFO ]: Start difference. First operand 164 states and 343 transitions. Second operand 18 states. [2018-06-26 18:00:04,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:00:04,029 INFO ]: Finished difference Result 271 states and 661 transitions. [2018-06-26 18:00:04,029 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-26 18:00:04,030 INFO ]: Start accepts. Automaton has 18 states. Word has length 34 [2018-06-26 18:00:04,030 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:00:04,035 INFO ]: With dead ends: 271 [2018-06-26 18:00:04,035 INFO ]: Without dead ends: 226 [2018-06-26 18:00:04,036 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=341, Invalid=1821, Unknown=0, NotChecked=0, Total=2162 [2018-06-26 18:00:04,036 INFO ]: Start minimizeSevpa. Operand 226 states. [2018-06-26 18:00:04,058 INFO ]: Finished minimizeSevpa. Reduced states from 226 to 166. [2018-06-26 18:00:04,058 INFO ]: Start removeUnreachable. Operand 166 states. [2018-06-26 18:00:04,062 INFO ]: Finished removeUnreachable. Reduced from 166 states to 166 states and 375 transitions. [2018-06-26 18:00:04,062 INFO ]: Start accepts. Automaton has 166 states and 375 transitions. Word has length 34 [2018-06-26 18:00:04,062 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:00:04,062 INFO ]: Abstraction has 166 states and 375 transitions. [2018-06-26 18:00:04,062 INFO ]: Interpolant automaton has 18 states. [2018-06-26 18:00:04,062 INFO ]: Start isEmpty. Operand 166 states and 375 transitions. [2018-06-26 18:00:04,066 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 18:00:04,066 INFO ]: Found error trace [2018-06-26 18:00:04,066 INFO ]: trace histogram [6, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:00:04,066 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:00:04,066 INFO ]: Analyzing trace with hash -363569060, now seen corresponding path program 4 times [2018-06-26 18:00:04,066 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:00:04,066 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:00:04,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:04,067 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:00:04,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:04,093 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:04,812 WARN ]: Spent 345.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-06-26 18:00:04,922 INFO ]: Checked inductivity of 83 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 18:00:04,922 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:00:04,922 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:00:04,929 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:00:04,982 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:00:04,982 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:04,986 INFO ]: Computing forward predicates... [2018-06-26 18:00:05,220 INFO ]: Checked inductivity of 83 backedges. 30 proven. 22 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-26 18:00:05,239 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:00:05,239 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 22 [2018-06-26 18:00:05,239 INFO ]: Interpolant automaton has 22 states [2018-06-26 18:00:05,239 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 18:00:05,239 INFO ]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:00:05,240 INFO ]: Start difference. First operand 166 states and 375 transitions. Second operand 22 states. [2018-06-26 18:00:06,654 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:00:06,654 INFO ]: Finished difference Result 301 states and 645 transitions. [2018-06-26 18:00:06,654 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-26 18:00:06,654 INFO ]: Start accepts. Automaton has 22 states. Word has length 35 [2018-06-26 18:00:06,654 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:00:06,656 INFO ]: With dead ends: 301 [2018-06-26 18:00:06,656 INFO ]: Without dead ends: 166 [2018-06-26 18:00:06,657 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=459, Invalid=2963, Unknown=0, NotChecked=0, Total=3422 [2018-06-26 18:00:06,657 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-26 18:00:06,670 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-06-26 18:00:06,670 INFO ]: Start removeUnreachable. Operand 166 states. [2018-06-26 18:00:06,673 INFO ]: Finished removeUnreachable. Reduced from 166 states to 166 states and 372 transitions. [2018-06-26 18:00:06,673 INFO ]: Start accepts. Automaton has 166 states and 372 transitions. Word has length 35 [2018-06-26 18:00:06,673 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:00:06,673 INFO ]: Abstraction has 166 states and 372 transitions. [2018-06-26 18:00:06,673 INFO ]: Interpolant automaton has 22 states. [2018-06-26 18:00:06,673 INFO ]: Start isEmpty. Operand 166 states and 372 transitions. [2018-06-26 18:00:06,675 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-26 18:00:06,675 INFO ]: Found error trace [2018-06-26 18:00:06,675 INFO ]: trace histogram [7, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:00:06,675 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:00:06,675 INFO ]: Analyzing trace with hash 443161996, now seen corresponding path program 5 times [2018-06-26 18:00:06,675 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:00:06,675 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:00:06,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:06,675 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:00:06,675 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:06,695 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:07,275 INFO ]: Checked inductivity of 94 backedges. 35 proven. 34 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-26 18:00:07,276 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:00:07,276 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:00:07,281 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:00:07,389 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 18:00:07,389 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:07,394 INFO ]: Computing forward predicates... [2018-06-26 18:00:07,664 INFO ]: Checked inductivity of 94 backedges. 51 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-26 18:00:07,689 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:00:07,689 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-06-26 18:00:07,690 INFO ]: Interpolant automaton has 21 states [2018-06-26 18:00:07,690 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 18:00:07,690 INFO ]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:00:07,690 INFO ]: Start difference. First operand 166 states and 372 transitions. Second operand 21 states. [2018-06-26 18:00:09,280 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:00:09,281 INFO ]: Finished difference Result 330 states and 779 transitions. [2018-06-26 18:00:09,281 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 18:00:09,281 INFO ]: Start accepts. Automaton has 21 states. Word has length 36 [2018-06-26 18:00:09,281 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:00:09,287 INFO ]: With dead ends: 330 [2018-06-26 18:00:09,287 INFO ]: Without dead ends: 330 [2018-06-26 18:00:09,287 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=247, Invalid=1645, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 18:00:09,287 INFO ]: Start minimizeSevpa. Operand 330 states. [2018-06-26 18:00:09,311 INFO ]: Finished minimizeSevpa. Reduced states from 330 to 301. [2018-06-26 18:00:09,311 INFO ]: Start removeUnreachable. Operand 301 states. [2018-06-26 18:00:09,318 INFO ]: Finished removeUnreachable. Reduced from 301 states to 301 states and 664 transitions. [2018-06-26 18:00:09,318 INFO ]: Start accepts. Automaton has 301 states and 664 transitions. Word has length 36 [2018-06-26 18:00:09,318 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:00:09,318 INFO ]: Abstraction has 301 states and 664 transitions. [2018-06-26 18:00:09,318 INFO ]: Interpolant automaton has 21 states. [2018-06-26 18:00:09,318 INFO ]: Start isEmpty. Operand 301 states and 664 transitions. [2018-06-26 18:00:09,321 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-26 18:00:09,321 INFO ]: Found error trace [2018-06-26 18:00:09,321 INFO ]: trace histogram [7, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:00:09,321 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:00:09,322 INFO ]: Analyzing trace with hash 12104563, now seen corresponding path program 5 times [2018-06-26 18:00:09,322 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:00:09,322 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:00:09,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:09,322 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:00:09,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:09,344 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:09,703 INFO ]: Checked inductivity of 98 backedges. 31 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-26 18:00:09,703 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:00:09,703 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 18:00:09,720 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:00:09,776 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 18:00:09,776 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:09,779 INFO ]: Computing forward predicates... [2018-06-26 18:00:09,991 INFO ]: Checked inductivity of 98 backedges. 53 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-26 18:00:10,012 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:00:10,013 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2018-06-26 18:00:10,013 INFO ]: Interpolant automaton has 27 states [2018-06-26 18:00:10,013 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 18:00:10,013 INFO ]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-06-26 18:00:10,013 INFO ]: Start difference. First operand 301 states and 664 transitions. Second operand 27 states. [2018-06-26 18:00:14,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:00:14,613 INFO ]: Finished difference Result 561 states and 1697 transitions. [2018-06-26 18:00:14,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-26 18:00:14,613 INFO ]: Start accepts. Automaton has 27 states. Word has length 36 [2018-06-26 18:00:14,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:00:14,619 INFO ]: With dead ends: 561 [2018-06-26 18:00:14,619 INFO ]: Without dead ends: 448 [2018-06-26 18:00:14,620 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1928 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=844, Invalid=6638, Unknown=0, NotChecked=0, Total=7482 [2018-06-26 18:00:14,621 INFO ]: Start minimizeSevpa. Operand 448 states. [2018-06-26 18:00:14,642 INFO ]: Finished minimizeSevpa. Reduced states from 448 to 370. [2018-06-26 18:00:14,642 INFO ]: Start removeUnreachable. Operand 370 states. [2018-06-26 18:00:14,647 INFO ]: Finished removeUnreachable. Reduced from 370 states to 370 states and 877 transitions. [2018-06-26 18:00:14,647 INFO ]: Start accepts. Automaton has 370 states and 877 transitions. Word has length 36 [2018-06-26 18:00:14,647 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:00:14,647 INFO ]: Abstraction has 370 states and 877 transitions. [2018-06-26 18:00:14,647 INFO ]: Interpolant automaton has 27 states. [2018-06-26 18:00:14,647 INFO ]: Start isEmpty. Operand 370 states and 877 transitions. [2018-06-26 18:00:14,649 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 18:00:14,649 INFO ]: Found error trace [2018-06-26 18:00:14,649 INFO ]: trace histogram [10, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:00:14,649 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:00:14,649 INFO ]: Analyzing trace with hash -1457102859, now seen corresponding path program 6 times [2018-06-26 18:00:14,649 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:00:14,649 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:00:14,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:14,650 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:00:14,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:14,662 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:14,832 INFO ]: Checked inductivity of 133 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 18:00:14,832 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:00:14,832 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:00:14,838 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:00:14,928 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-26 18:00:14,928 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:14,931 INFO ]: Computing forward predicates... [2018-06-26 18:00:15,039 INFO ]: Checked inductivity of 133 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-26 18:00:15,058 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:00:15,058 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-06-26 18:00:15,059 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:00:15,059 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:00:15,059 INFO ]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:00:15,059 INFO ]: Start difference. First operand 370 states and 877 transitions. Second operand 20 states. [2018-06-26 18:00:17,382 WARN ]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-26 18:00:17,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:00:17,655 INFO ]: Finished difference Result 853 states and 2265 transitions. [2018-06-26 18:00:17,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-26 18:00:17,656 INFO ]: Start accepts. Automaton has 20 states. Word has length 39 [2018-06-26 18:00:17,656 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:00:17,685 INFO ]: With dead ends: 853 [2018-06-26 18:00:17,685 INFO ]: Without dead ends: 823 [2018-06-26 18:00:17,686 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=2121, Unknown=0, NotChecked=0, Total=2450 [2018-06-26 18:00:17,686 INFO ]: Start minimizeSevpa. Operand 823 states. [2018-06-26 18:00:17,774 INFO ]: Finished minimizeSevpa. Reduced states from 823 to 589. [2018-06-26 18:00:17,774 INFO ]: Start removeUnreachable. Operand 589 states. [2018-06-26 18:00:17,788 INFO ]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1373 transitions. [2018-06-26 18:00:17,788 INFO ]: Start accepts. Automaton has 589 states and 1373 transitions. Word has length 39 [2018-06-26 18:00:17,788 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:00:17,788 INFO ]: Abstraction has 589 states and 1373 transitions. [2018-06-26 18:00:17,788 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:00:17,788 INFO ]: Start isEmpty. Operand 589 states and 1373 transitions. [2018-06-26 18:00:17,792 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 18:00:17,792 INFO ]: Found error trace [2018-06-26 18:00:17,792 INFO ]: trace histogram [10, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:00:17,792 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:00:17,792 INFO ]: Analyzing trace with hash 1422514298, now seen corresponding path program 7 times [2018-06-26 18:00:17,792 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:00:17,792 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:00:17,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:17,799 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:00:17,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:17,827 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:18,005 INFO ]: Checked inductivity of 133 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-26 18:00:18,005 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:00:18,005 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:00:18,011 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:00:18,078 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:18,082 INFO ]: Computing forward predicates... [2018-06-26 18:00:18,191 INFO ]: Checked inductivity of 133 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-26 18:00:18,211 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:00:18,211 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 18:00:18,211 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:00:18,211 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:00:18,211 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:00:18,211 INFO ]: Start difference. First operand 589 states and 1373 transitions. Second operand 11 states. [2018-06-26 18:00:18,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:00:18,724 INFO ]: Finished difference Result 999 states and 2438 transitions. [2018-06-26 18:00:18,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:00:18,724 INFO ]: Start accepts. Automaton has 11 states. Word has length 39 [2018-06-26 18:00:18,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:00:18,758 INFO ]: With dead ends: 999 [2018-06-26 18:00:18,758 INFO ]: Without dead ends: 954 [2018-06-26 18:00:18,758 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:00:18,758 INFO ]: Start minimizeSevpa. Operand 954 states. [2018-06-26 18:00:18,840 INFO ]: Finished minimizeSevpa. Reduced states from 954 to 604. [2018-06-26 18:00:18,840 INFO ]: Start removeUnreachable. Operand 604 states. [2018-06-26 18:00:18,850 INFO ]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1403 transitions. [2018-06-26 18:00:18,850 INFO ]: Start accepts. Automaton has 604 states and 1403 transitions. Word has length 39 [2018-06-26 18:00:18,850 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:00:18,850 INFO ]: Abstraction has 604 states and 1403 transitions. [2018-06-26 18:00:18,850 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:00:18,850 INFO ]: Start isEmpty. Operand 604 states and 1403 transitions. [2018-06-26 18:00:18,854 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 18:00:18,854 INFO ]: Found error trace [2018-06-26 18:00:18,856 INFO ]: trace histogram [11, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:00:18,856 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:00:18,856 INFO ]: Analyzing trace with hash 1352048943, now seen corresponding path program 6 times [2018-06-26 18:00:18,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:00:18,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:00:18,857 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:18,857 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:00:18,857 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:18,880 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:19,493 INFO ]: Checked inductivity of 152 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-26 18:00:19,493 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:00:19,521 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:00:19,527 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:00:19,596 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-26 18:00:19,596 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:19,599 INFO ]: Computing forward predicates... [2018-06-26 18:00:19,733 INFO ]: Checked inductivity of 152 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-06-26 18:00:19,755 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:00:19,755 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2018-06-26 18:00:19,756 INFO ]: Interpolant automaton has 28 states [2018-06-26 18:00:19,756 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 18:00:19,756 INFO ]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:00:19,756 INFO ]: Start difference. First operand 604 states and 1403 transitions. Second operand 28 states. [2018-06-26 18:00:22,954 WARN ]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-26 18:00:24,306 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-26 18:00:26,319 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-26 18:00:28,048 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:00:28,048 INFO ]: Finished difference Result 1934 states and 7503 transitions. [2018-06-26 18:00:28,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-06-26 18:00:28,048 INFO ]: Start accepts. Automaton has 28 states. Word has length 40 [2018-06-26 18:00:28,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:00:28,174 INFO ]: With dead ends: 1934 [2018-06-26 18:00:28,174 INFO ]: Without dead ends: 1844 [2018-06-26 18:00:28,177 INFO ]: 0 DeclaredPredicates, 168 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4626 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2121, Invalid=12159, Unknown=0, NotChecked=0, Total=14280 [2018-06-26 18:00:28,179 INFO ]: Start minimizeSevpa. Operand 1844 states. [2018-06-26 18:00:28,507 INFO ]: Finished minimizeSevpa. Reduced states from 1844 to 944. [2018-06-26 18:00:28,508 INFO ]: Start removeUnreachable. Operand 944 states. [2018-06-26 18:00:28,527 INFO ]: Finished removeUnreachable. Reduced from 944 states to 944 states and 2158 transitions. [2018-06-26 18:00:28,527 INFO ]: Start accepts. Automaton has 944 states and 2158 transitions. Word has length 40 [2018-06-26 18:00:28,528 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:00:28,528 INFO ]: Abstraction has 944 states and 2158 transitions. [2018-06-26 18:00:28,528 INFO ]: Interpolant automaton has 28 states. [2018-06-26 18:00:28,528 INFO ]: Start isEmpty. Operand 944 states and 2158 transitions. [2018-06-26 18:00:28,533 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-26 18:00:28,533 INFO ]: Found error trace [2018-06-26 18:00:28,533 INFO ]: trace histogram [13, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:00:28,533 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:00:28,534 INFO ]: Analyzing trace with hash 1941782913, now seen corresponding path program 7 times [2018-06-26 18:00:28,534 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:00:28,534 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:00:28,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:28,534 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:00:28,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:28,563 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:28,977 INFO ]: Checked inductivity of 185 backedges. 81 proven. 76 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:00:28,977 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:00:28,977 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:00:28,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:00:29,063 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:29,067 INFO ]: Computing forward predicates... [2018-06-26 18:00:29,238 INFO ]: Checked inductivity of 185 backedges. 115 proven. 33 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-26 18:00:29,257 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:00:29,258 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-06-26 18:00:29,258 INFO ]: Interpolant automaton has 25 states [2018-06-26 18:00:29,258 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 18:00:29,258 INFO ]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2018-06-26 18:00:29,258 INFO ]: Start difference. First operand 944 states and 2158 transitions. Second operand 25 states. [2018-06-26 18:00:29,703 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-06-26 18:00:30,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:00:30,699 INFO ]: Finished difference Result 1629 states and 3863 transitions. [2018-06-26 18:00:30,699 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 18:00:30,699 INFO ]: Start accepts. Automaton has 25 states. Word has length 42 [2018-06-26 18:00:30,699 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:00:30,732 INFO ]: With dead ends: 1629 [2018-06-26 18:00:30,732 INFO ]: Without dead ends: 1629 [2018-06-26 18:00:30,733 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=295, Invalid=1775, Unknown=0, NotChecked=0, Total=2070 [2018-06-26 18:00:30,734 INFO ]: Start minimizeSevpa. Operand 1629 states. [2018-06-26 18:00:30,835 INFO ]: Finished minimizeSevpa. Reduced states from 1629 to 1495. [2018-06-26 18:00:30,835 INFO ]: Start removeUnreachable. Operand 1495 states. [2018-06-26 18:00:30,864 INFO ]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 3314 transitions. [2018-06-26 18:00:30,864 INFO ]: Start accepts. Automaton has 1495 states and 3314 transitions. Word has length 42 [2018-06-26 18:00:30,865 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:00:30,865 INFO ]: Abstraction has 1495 states and 3314 transitions. [2018-06-26 18:00:30,866 INFO ]: Interpolant automaton has 25 states. [2018-06-26 18:00:30,866 INFO ]: Start isEmpty. Operand 1495 states and 3314 transitions. [2018-06-26 18:00:30,871 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-26 18:00:30,871 INFO ]: Found error trace [2018-06-26 18:00:30,871 INFO ]: trace histogram [15, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:00:30,872 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:00:30,872 INFO ]: Analyzing trace with hash 1146470655, now seen corresponding path program 8 times [2018-06-26 18:00:30,872 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:00:30,872 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:00:30,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:30,873 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:00:30,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:30,895 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:31,205 INFO ]: Checked inductivity of 222 backedges. 71 proven. 15 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-06-26 18:00:31,205 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:00:31,205 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:00:31,213 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:00:31,292 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:00:31,292 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:31,297 INFO ]: Computing forward predicates... [2018-06-26 18:00:31,503 INFO ]: Checked inductivity of 222 backedges. 58 proven. 79 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-26 18:00:31,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:00:31,537 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2018-06-26 18:00:31,537 INFO ]: Interpolant automaton has 29 states [2018-06-26 18:00:31,538 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 18:00:31,538 INFO ]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2018-06-26 18:00:31,538 INFO ]: Start difference. First operand 1495 states and 3314 transitions. Second operand 29 states. [2018-06-26 18:00:32,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:00:32,135 INFO ]: Finished difference Result 2524 states and 5687 transitions. [2018-06-26 18:00:32,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 18:00:32,136 INFO ]: Start accepts. Automaton has 29 states. Word has length 44 [2018-06-26 18:00:32,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:00:32,228 INFO ]: With dead ends: 2524 [2018-06-26 18:00:32,228 INFO ]: Without dead ends: 2468 [2018-06-26 18:00:32,228 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=1974, Unknown=0, NotChecked=0, Total=2256 [2018-06-26 18:00:32,230 INFO ]: Start minimizeSevpa. Operand 2468 states. [2018-06-26 18:00:32,384 INFO ]: Finished minimizeSevpa. Reduced states from 2468 to 1600. [2018-06-26 18:00:32,384 INFO ]: Start removeUnreachable. Operand 1600 states. [2018-06-26 18:00:32,421 INFO ]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3566 transitions. [2018-06-26 18:00:32,421 INFO ]: Start accepts. Automaton has 1600 states and 3566 transitions. Word has length 44 [2018-06-26 18:00:32,421 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:00:32,421 INFO ]: Abstraction has 1600 states and 3566 transitions. [2018-06-26 18:00:32,421 INFO ]: Interpolant automaton has 29 states. [2018-06-26 18:00:32,421 INFO ]: Start isEmpty. Operand 1600 states and 3566 transitions. [2018-06-26 18:00:32,428 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-26 18:00:32,428 INFO ]: Found error trace [2018-06-26 18:00:32,428 INFO ]: trace histogram [12, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:00:32,428 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:00:32,428 INFO ]: Analyzing trace with hash 1868129412, now seen corresponding path program 8 times [2018-06-26 18:00:32,428 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:00:32,428 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:00:32,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:32,429 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:00:32,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:32,452 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:33,036 INFO ]: Checked inductivity of 197 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-06-26 18:00:33,036 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:00:33,036 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:00:33,042 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:00:33,115 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:00:33,115 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:33,118 INFO ]: Computing forward predicates... [2018-06-26 18:00:33,449 INFO ]: Checked inductivity of 197 backedges. 55 proven. 52 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-06-26 18:00:33,469 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:00:33,469 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 29 [2018-06-26 18:00:33,469 INFO ]: Interpolant automaton has 29 states [2018-06-26 18:00:33,469 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 18:00:33,469 INFO ]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2018-06-26 18:00:33,469 INFO ]: Start difference. First operand 1600 states and 3566 transitions. Second operand 29 states. [2018-06-26 18:00:35,099 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:00:35,099 INFO ]: Finished difference Result 1887 states and 4666 transitions. [2018-06-26 18:00:35,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-26 18:00:35,099 INFO ]: Start accepts. Automaton has 29 states. Word has length 47 [2018-06-26 18:00:35,099 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:00:35,143 INFO ]: With dead ends: 1887 [2018-06-26 18:00:35,143 INFO ]: Without dead ends: 1434 [2018-06-26 18:00:35,144 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=735, Invalid=5271, Unknown=0, NotChecked=0, Total=6006 [2018-06-26 18:00:35,145 INFO ]: Start minimizeSevpa. Operand 1434 states. [2018-06-26 18:00:35,301 INFO ]: Finished minimizeSevpa. Reduced states from 1434 to 1128. [2018-06-26 18:00:35,301 INFO ]: Start removeUnreachable. Operand 1128 states. [2018-06-26 18:00:35,322 INFO ]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 2549 transitions. [2018-06-26 18:00:35,322 INFO ]: Start accepts. Automaton has 1128 states and 2549 transitions. Word has length 47 [2018-06-26 18:00:35,323 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:00:35,323 INFO ]: Abstraction has 1128 states and 2549 transitions. [2018-06-26 18:00:35,323 INFO ]: Interpolant automaton has 29 states. [2018-06-26 18:00:35,323 INFO ]: Start isEmpty. Operand 1128 states and 2549 transitions. [2018-06-26 18:00:35,325 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-26 18:00:35,325 INFO ]: Found error trace [2018-06-26 18:00:35,325 INFO ]: trace histogram [16, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:00:35,325 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:00:35,326 INFO ]: Analyzing trace with hash -2068814996, now seen corresponding path program 9 times [2018-06-26 18:00:35,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:00:35,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:00:35,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:35,326 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:00:35,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:35,353 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:36,133 INFO ]: Checked inductivity of 275 backedges. 85 proven. 102 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-26 18:00:36,133 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:00:36,133 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:00:36,139 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:00:36,220 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 18:00:36,220 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:36,224 INFO ]: Computing forward predicates... [2018-06-26 18:00:36,440 INFO ]: Checked inductivity of 275 backedges. 135 proven. 24 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-26 18:00:36,459 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:00:36,460 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-06-26 18:00:36,460 INFO ]: Interpolant automaton has 28 states [2018-06-26 18:00:36,460 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 18:00:36,460 INFO ]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:00:36,460 INFO ]: Start difference. First operand 1128 states and 2549 transitions. Second operand 28 states. [2018-06-26 18:00:38,835 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:00:38,835 INFO ]: Finished difference Result 1723 states and 4226 transitions. [2018-06-26 18:00:38,835 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-26 18:00:38,835 INFO ]: Start accepts. Automaton has 28 states. Word has length 51 [2018-06-26 18:00:38,835 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:00:38,882 INFO ]: With dead ends: 1723 [2018-06-26 18:00:38,882 INFO ]: Without dead ends: 1686 [2018-06-26 18:00:38,883 INFO ]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2115 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=679, Invalid=6631, Unknown=0, NotChecked=0, Total=7310 [2018-06-26 18:00:38,884 INFO ]: Start minimizeSevpa. Operand 1686 states. [2018-06-26 18:00:38,988 INFO ]: Finished minimizeSevpa. Reduced states from 1686 to 1187. [2018-06-26 18:00:38,988 INFO ]: Start removeUnreachable. Operand 1187 states. [2018-06-26 18:00:39,010 INFO ]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2668 transitions. [2018-06-26 18:00:39,010 INFO ]: Start accepts. Automaton has 1187 states and 2668 transitions. Word has length 51 [2018-06-26 18:00:39,010 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:00:39,010 INFO ]: Abstraction has 1187 states and 2668 transitions. [2018-06-26 18:00:39,010 INFO ]: Interpolant automaton has 28 states. [2018-06-26 18:00:39,010 INFO ]: Start isEmpty. Operand 1187 states and 2668 transitions. [2018-06-26 18:00:39,012 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-26 18:00:39,012 INFO ]: Found error trace [2018-06-26 18:00:39,012 INFO ]: trace histogram [18, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:00:39,012 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:00:39,013 INFO ]: Analyzing trace with hash 1270504313, now seen corresponding path program 10 times [2018-06-26 18:00:39,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:00:39,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:00:39,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:39,013 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:00:39,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:39,047 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:39,992 INFO ]: Checked inductivity of 322 backedges. 85 proven. 16 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-06-26 18:00:39,992 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:00:39,992 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:00:39,997 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:00:40,084 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:00:40,084 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:00:40,089 INFO ]: Computing forward predicates... [2018-06-26 18:00:40,347 INFO ]: Checked inductivity of 322 backedges. 85 proven. 16 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-06-26 18:00:40,366 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:00:40,438 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 18:00:40,438 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:00:40,438 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:00:40,438 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:00:40,439 INFO ]: Start difference. First operand 1187 states and 2668 transitions. Second operand 13 states. [2018-06-26 18:00:40,915 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:00:40,915 INFO ]: Finished difference Result 2291 states and 5296 transitions. [2018-06-26 18:00:40,915 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:00:40,915 INFO ]: Start accepts. Automaton has 13 states. Word has length 53 [2018-06-26 18:00:40,915 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:00:41,053 INFO ]: With dead ends: 2291 [2018-06-26 18:00:41,054 INFO ]: Without dead ends: 2267 [2018-06-26 18:00:41,057 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:00:41,058 INFO ]: Start minimizeSevpa. Operand 2267 states. [2018-06-26 18:00:41,213 INFO ]: Finished minimizeSevpa. Reduced states from 2267 to 1187. [2018-06-26 18:00:41,213 INFO ]: Start removeUnreachable. Operand 1187 states. [2018-06-26 18:00:41,244 INFO ]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2668 transitions. [2018-06-26 18:00:41,244 INFO ]: Start accepts. Automaton has 1187 states and 2668 transitions. Word has length 53 [2018-06-26 18:00:41,244 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:00:41,244 INFO ]: Abstraction has 1187 states and 2668 transitions. [2018-06-26 18:00:41,244 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:00:41,244 INFO ]: Start isEmpty. Operand 1187 states and 2668 transitions. [2018-06-26 18:00:41,246 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-26 18:00:41,246 INFO ]: Found error trace [2018-06-26 18:00:41,246 INFO ]: trace histogram [18, 6, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:00:41,246 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:00:41,247 INFO ]: Analyzing trace with hash 1021762784, now seen corresponding path program 9 times [2018-06-26 18:00:41,247 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:00:41,247 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:00:41,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:41,247 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:00:41,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:00:41,278 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-26 18:00:41,418 WARN ]: Removed 1 from assertion stack [2018-06-26 18:00:41,419 WARN ]: Verification canceled [2018-06-26 18:00:41,421 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:00:41,422 WARN ]: Timeout [2018-06-26 18:00:41,424 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:00:41 BasicIcfg [2018-06-26 18:00:41,424 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:00:41,424 INFO ]: Toolchain (without parser) took 54935.63 ms. Allocated memory was 307.2 MB in the beginning and 962.6 MB in the end (delta: 655.4 MB). Free memory was 261.5 MB in the beginning and 864.7 MB in the end (delta: -603.1 MB). Peak memory consumption was 52.2 MB. Max. memory is 3.6 GB. [2018-06-26 18:00:41,425 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:00:41,425 INFO ]: ChcToBoogie took 60.53 ms. Allocated memory is still 307.2 MB. Free memory was 261.5 MB in the beginning and 259.6 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:00:41,426 INFO ]: Boogie Preprocessor took 31.20 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 257.6 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:00:41,426 INFO ]: RCFGBuilder took 431.02 ms. Allocated memory is still 307.2 MB. Free memory was 257.6 MB in the beginning and 243.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:00:41,427 INFO ]: BlockEncodingV2 took 82.80 ms. Allocated memory is still 307.2 MB. Free memory was 243.6 MB in the beginning and 240.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:00:41,428 INFO ]: TraceAbstraction took 54320.00 ms. Allocated memory was 307.2 MB in the beginning and 962.6 MB in the end (delta: 655.4 MB). Free memory was 240.6 MB in the beginning and 864.7 MB in the end (delta: -624.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 3.6 GB. [2018-06-26 18:00:41,430 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 20 locations, 30 edges - StatisticsResult: Encoded RCFG 15 locations, 25 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.53 ms. Allocated memory is still 307.2 MB. Free memory was 261.5 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 31.20 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 257.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 431.02 ms. Allocated memory is still 307.2 MB. Free memory was 257.6 MB in the beginning and 243.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 82.80 ms. Allocated memory is still 307.2 MB. Free memory was 243.6 MB in the beginning and 240.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54320.00 ms. Allocated memory was 307.2 MB in the beginning and 962.6 MB in the end (delta: 655.4 MB). Free memory was 240.6 MB in the beginning and 864.7 MB in the end (delta: -624.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 18, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. TIMEOUT Result, 54.2s OverallTime, 30 OverallIterations, 18 TraceHistogramMax, 36.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1006 SDtfs, 1232 SDslu, 5854 SDs, 0 SdLazy, 22845 SolverSat, 4197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1582 GetRequests, 680 SyntacticMatches, 18 SemanticMatches, 884 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14644 ImplicationChecksByTransitivity, 23.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1600occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 4882 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 1519 NumberOfCodeBlocks, 1500 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 1468 ConstructedInterpolants, 0 QuantifiedInterpolants, 175464 SizeOfPredicates, 195 NumberOfNonLiveVariables, 11445 ConjunctsInSsa, 663 ConjunctsInUnsatCore, 51 InterpolantComputations, 8 PerfectInterpolantSequences, 3724/4504 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/005b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-00-41-444.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/005b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-00-41-444.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/005b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-00-41-444.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/005b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-00-41-444.csv Completed graceful shutdown