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/vmt-chc-benchmarks/cav12/mem_slave_tlm.3.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 23:53:39,129 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 23:53:39,131 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 23:53:39,143 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 23:53:39,143 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 23:53:39,144 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 23:53:39,146 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 23:53:39,148 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 23:53:39,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 23:53:39,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 23:53:39,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 23:53:39,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 23:53:39,152 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 23:53:39,153 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 23:53:39,153 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 23:53:39,154 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 23:53:39,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 23:53:39,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 23:53:39,159 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 23:53:39,169 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 23:53:39,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 23:53:39,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 23:53:39,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 23:53:39,173 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 23:53:39,173 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 23:53:39,174 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 23:53:39,175 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 23:53:39,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 23:53:39,177 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 23:53:39,177 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 23:53:39,185 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 23:53:39,186 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 23:53:39,186 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 23:53:39,187 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 23:53:39,187 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 23:53:39,187 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 23:53:39,212 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 23:53:39,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 23:53:39,213 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 23:53:39,213 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 23:53:39,218 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 23:53:39,218 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 23:53:39,218 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 23:53:39,219 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 23:53:39,219 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 23:53:39,219 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 23:53:39,219 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 23:53:39,220 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 23:53:39,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 23:53:39,220 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 23:53:39,220 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 23:53:39,220 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 23:53:39,221 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 23:53:39,222 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 23:53:39,222 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 23:53:39,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 23:53:39,222 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 23:53:39,224 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 23:53:39,224 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 23:53:39,266 INFO ]: Repository-Root is: /tmp [2018-06-24 23:53:39,285 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 23:53:39,294 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 23:53:39,295 INFO ]: Initializing SmtParser... [2018-06-24 23:53:39,296 INFO ]: SmtParser initialized [2018-06-24 23:53:39,296 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.3.smt2 [2018-06-24 23:53:39,297 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 23:53:39,391 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.3.smt2 unknown [2018-06-24 23:53:40,331 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.3.smt2 [2018-06-24 23:53:40,335 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 23:53:40,341 INFO ]: Walking toolchain with 5 elements. [2018-06-24 23:53:40,342 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 23:53:40,342 INFO ]: Initializing ChcToBoogie... [2018-06-24 23:53:40,342 INFO ]: ChcToBoogie initialized [2018-06-24 23:53:40,346 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 11:53:40" (1/1) ... [2018-06-24 23:53:40,480 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:40 Unit [2018-06-24 23:53:40,480 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 23:53:40,481 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 23:53:40,481 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 23:53:40,481 INFO ]: Boogie Preprocessor initialized [2018-06-24 23:53:40,500 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:40" (1/1) ... [2018-06-24 23:53:40,500 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:40" (1/1) ... [2018-06-24 23:53:40,522 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:40" (1/1) ... [2018-06-24 23:53:40,522 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:40" (1/1) ... [2018-06-24 23:53:40,551 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:40" (1/1) ... [2018-06-24 23:53:40,552 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:40" (1/1) ... [2018-06-24 23:53:40,557 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:40" (1/1) ... [2018-06-24 23:53:40,563 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 23:53:40,564 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 23:53:40,564 INFO ]: Initializing RCFGBuilder... [2018-06-24 23:53:40,564 INFO ]: RCFGBuilder initialized [2018-06-24 23:53:40,565 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:40" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 23:53:40,586 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 23:53:40,586 INFO ]: Found specification of procedure gotoProc [2018-06-24 23:53:40,586 INFO ]: Found implementation of procedure gotoProc [2018-06-24 23:53:40,586 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 23:53:40,586 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 23:53:40,586 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 23:53:41,348 INFO ]: Using library mode [2018-06-24 23:53:41,348 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:53:41 BoogieIcfgContainer [2018-06-24 23:53:41,348 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 23:53:41,351 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 23:53:41,351 INFO ]: Initializing BlockEncodingV2... [2018-06-24 23:53:41,352 INFO ]: BlockEncodingV2 initialized [2018-06-24 23:53:41,353 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:53:41" (1/1) ... [2018-06-24 23:53:41,372 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-24 23:53:41,373 INFO ]: Using Remove infeasible edges [2018-06-24 23:53:41,374 INFO ]: Using Maximize final states [2018-06-24 23:53:41,374 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 23:53:41,374 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 23:53:41,376 INFO ]: Using Remove sink states [2018-06-24 23:53:41,379 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 23:53:41,379 INFO ]: Using Use SBE [2018-06-24 23:53:41,433 WARN ]: expecting exponential blowup for input size 6 [2018-06-24 23:53:45,408 INFO ]: SBE split 1 edges [2018-06-24 23:53:45,417 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 23:53:45,419 INFO ]: 0 new accepting states [2018-06-24 23:53:45,475 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 23:53:45,477 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 23:53:45,484 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 23:53:45,485 INFO ]: 0 new accepting states [2018-06-24 23:53:45,485 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 23:53:45,485 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 23:53:45,490 INFO ]: Encoded RCFG 6 locations, 105 edges [2018-06-24 23:53:45,490 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 11:53:45 BasicIcfg [2018-06-24 23:53:45,490 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 23:53:45,491 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 23:53:45,492 INFO ]: Initializing TraceAbstraction... [2018-06-24 23:53:45,496 INFO ]: TraceAbstraction initialized [2018-06-24 23:53:45,496 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 11:53:40" (1/4) ... [2018-06-24 23:53:45,497 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbcc63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 11:53:45, skipping insertion in model container [2018-06-24 23:53:45,497 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:53:40" (2/4) ... [2018-06-24 23:53:45,497 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbcc63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 11:53:45, skipping insertion in model container [2018-06-24 23:53:45,497 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:53:41" (3/4) ... [2018-06-24 23:53:45,497 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbcc63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 11:53:45, skipping insertion in model container [2018-06-24 23:53:45,497 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 11:53:45" (4/4) ... [2018-06-24 23:53:45,498 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 23:53:45,508 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 23:53:45,516 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 23:53:45,559 INFO ]: Using default assertion order modulation [2018-06-24 23:53:45,559 INFO ]: Interprodecural is true [2018-06-24 23:53:45,559 INFO ]: Hoare is false [2018-06-24 23:53:45,559 INFO ]: Compute interpolants for FPandBP [2018-06-24 23:53:45,559 INFO ]: Backedges is TWOTRACK [2018-06-24 23:53:45,559 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 23:53:45,560 INFO ]: Difference is false [2018-06-24 23:53:45,560 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 23:53:45,560 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 23:53:45,571 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 23:53:45,583 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 23:53:45,583 INFO ]: Found error trace [2018-06-24 23:53:45,584 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 23:53:45,584 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:45,590 INFO ]: Analyzing trace with hash 38477762, now seen corresponding path program 1 times [2018-06-24 23:53:45,592 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:45,592 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:45,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:45,628 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:45,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:45,717 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:45,868 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:53:45,871 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:45,871 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:45,873 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:45,888 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:45,888 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:45,891 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 23:53:47,227 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:47,227 INFO ]: Finished difference Result 7 states and 164 transitions. [2018-06-24 23:53:47,228 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:47,228 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 23:53:47,229 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:47,236 INFO ]: With dead ends: 7 [2018-06-24 23:53:47,236 INFO ]: Without dead ends: 7 [2018-06-24 23:53:47,238 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:47,257 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 23:53:47,282 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 23:53:47,283 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 23:53:47,284 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2018-06-24 23:53:47,285 INFO ]: Start accepts. Automaton has 7 states and 164 transitions. Word has length 5 [2018-06-24 23:53:47,286 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:47,286 INFO ]: Abstraction has 7 states and 164 transitions. [2018-06-24 23:53:47,286 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:47,286 INFO ]: Start isEmpty. Operand 7 states and 164 transitions. [2018-06-24 23:53:47,287 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 23:53:47,287 INFO ]: Found error trace [2018-06-24 23:53:47,287 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 23:53:47,287 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:47,287 INFO ]: Analyzing trace with hash 1189899912, now seen corresponding path program 1 times [2018-06-24 23:53:47,287 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:47,287 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:47,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:47,288 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:47,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:47,332 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:47,413 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:53:47,413 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:47,413 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:47,414 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:47,415 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:47,415 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:47,415 INFO ]: Start difference. First operand 7 states and 164 transitions. Second operand 3 states. [2018-06-24 23:53:48,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:48,555 INFO ]: Finished difference Result 9 states and 257 transitions. [2018-06-24 23:53:48,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:48,555 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 23:53:48,556 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:48,557 INFO ]: With dead ends: 9 [2018-06-24 23:53:48,557 INFO ]: Without dead ends: 9 [2018-06-24 23:53:48,557 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:48,557 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 23:53:48,561 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 23:53:48,561 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 23:53:48,562 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 257 transitions. [2018-06-24 23:53:48,562 INFO ]: Start accepts. Automaton has 9 states and 257 transitions. Word has length 6 [2018-06-24 23:53:48,563 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:48,563 INFO ]: Abstraction has 9 states and 257 transitions. [2018-06-24 23:53:48,563 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:48,563 INFO ]: Start isEmpty. Operand 9 states and 257 transitions. [2018-06-24 23:53:48,563 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 23:53:48,563 INFO ]: Found error trace [2018-06-24 23:53:48,563 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 23:53:48,563 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:48,564 INFO ]: Analyzing trace with hash 1190078658, now seen corresponding path program 1 times [2018-06-24 23:53:48,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:48,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:48,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:48,564 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:48,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:48,597 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:48,677 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:53:48,677 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:48,677 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:48,677 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:48,677 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:48,677 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:48,678 INFO ]: Start difference. First operand 9 states and 257 transitions. Second operand 3 states. [2018-06-24 23:53:49,411 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:49,411 INFO ]: Finished difference Result 13 states and 348 transitions. [2018-06-24 23:53:49,411 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:49,411 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 23:53:49,411 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:49,412 INFO ]: With dead ends: 13 [2018-06-24 23:53:49,412 INFO ]: Without dead ends: 13 [2018-06-24 23:53:49,413 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:49,413 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 23:53:49,419 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 23:53:49,419 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 23:53:49,420 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 348 transitions. [2018-06-24 23:53:49,420 INFO ]: Start accepts. Automaton has 13 states and 348 transitions. Word has length 6 [2018-06-24 23:53:49,421 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:49,421 INFO ]: Abstraction has 13 states and 348 transitions. [2018-06-24 23:53:49,421 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:49,421 INFO ]: Start isEmpty. Operand 13 states and 348 transitions. [2018-06-24 23:53:49,421 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 23:53:49,421 INFO ]: Found error trace [2018-06-24 23:53:49,421 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 23:53:49,421 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:49,422 INFO ]: Analyzing trace with hash 1190495732, now seen corresponding path program 1 times [2018-06-24 23:53:49,422 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:49,422 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:49,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:49,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:49,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:49,445 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:49,508 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:53:49,508 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:49,508 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:49,508 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:49,508 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:49,508 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:49,508 INFO ]: Start difference. First operand 13 states and 348 transitions. Second operand 3 states. [2018-06-24 23:53:50,151 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:50,151 INFO ]: Finished difference Result 20 states and 527 transitions. [2018-06-24 23:53:50,151 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:50,151 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 23:53:50,152 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:50,152 INFO ]: With dead ends: 20 [2018-06-24 23:53:50,152 INFO ]: Without dead ends: 20 [2018-06-24 23:53:50,152 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:50,153 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 23:53:50,157 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 23:53:50,157 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 23:53:50,159 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 527 transitions. [2018-06-24 23:53:50,159 INFO ]: Start accepts. Automaton has 20 states and 527 transitions. Word has length 6 [2018-06-24 23:53:50,159 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:50,159 INFO ]: Abstraction has 20 states and 527 transitions. [2018-06-24 23:53:50,159 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:50,159 INFO ]: Start isEmpty. Operand 20 states and 527 transitions. [2018-06-24 23:53:50,159 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 23:53:50,159 INFO ]: Found error trace [2018-06-24 23:53:50,159 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 23:53:50,159 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:50,160 INFO ]: Analyzing trace with hash 1190972388, now seen corresponding path program 1 times [2018-06-24 23:53:50,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:50,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:50,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:50,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:50,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:50,180 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:50,251 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:53:50,251 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:50,251 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:50,252 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:50,252 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:50,252 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:50,252 INFO ]: Start difference. First operand 20 states and 527 transitions. Second operand 3 states. [2018-06-24 23:53:50,787 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:50,788 INFO ]: Finished difference Result 20 states and 406 transitions. [2018-06-24 23:53:50,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:50,788 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 23:53:50,788 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:50,789 INFO ]: With dead ends: 20 [2018-06-24 23:53:50,789 INFO ]: Without dead ends: 20 [2018-06-24 23:53:50,789 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:50,789 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 23:53:50,793 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 23:53:50,793 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 23:53:50,795 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 406 transitions. [2018-06-24 23:53:50,795 INFO ]: Start accepts. Automaton has 20 states and 406 transitions. Word has length 6 [2018-06-24 23:53:50,795 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:50,795 INFO ]: Abstraction has 20 states and 406 transitions. [2018-06-24 23:53:50,795 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:50,795 INFO ]: Start isEmpty. Operand 20 states and 406 transitions. [2018-06-24 23:53:50,795 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 23:53:50,795 INFO ]: Found error trace [2018-06-24 23:53:50,795 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:50,796 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:50,796 INFO ]: Analyzing trace with hash -1764105500, now seen corresponding path program 1 times [2018-06-24 23:53:50,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:50,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:50,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:50,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:50,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:50,857 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:50,966 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:53:50,966 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:50,966 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:50,966 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:50,966 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:50,966 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:50,967 INFO ]: Start difference. First operand 20 states and 406 transitions. Second operand 3 states. [2018-06-24 23:53:51,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:51,508 INFO ]: Finished difference Result 20 states and 262 transitions. [2018-06-24 23:53:51,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:51,508 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 23:53:51,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:51,508 INFO ]: With dead ends: 20 [2018-06-24 23:53:51,508 INFO ]: Without dead ends: 20 [2018-06-24 23:53:51,509 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:51,509 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 23:53:51,511 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 23:53:51,511 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 23:53:51,512 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 262 transitions. [2018-06-24 23:53:51,512 INFO ]: Start accepts. Automaton has 20 states and 262 transitions. Word has length 7 [2018-06-24 23:53:51,512 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:51,512 INFO ]: Abstraction has 20 states and 262 transitions. [2018-06-24 23:53:51,512 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:51,512 INFO ]: Start isEmpty. Operand 20 states and 262 transitions. [2018-06-24 23:53:51,514 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 23:53:51,514 INFO ]: Found error trace [2018-06-24 23:53:51,514 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:51,514 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:51,514 INFO ]: Analyzing trace with hash 1192565685, now seen corresponding path program 1 times [2018-06-24 23:53:51,514 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:51,514 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:51,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:51,515 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:51,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:51,550 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:51,630 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 23:53:51,631 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:51,631 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:51,631 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:51,631 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:51,631 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:51,631 INFO ]: Start difference. First operand 20 states and 262 transitions. Second operand 3 states. [2018-06-24 23:53:52,174 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:52,174 INFO ]: Finished difference Result 31 states and 367 transitions. [2018-06-24 23:53:52,176 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:52,176 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 23:53:52,176 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:52,177 INFO ]: With dead ends: 31 [2018-06-24 23:53:52,177 INFO ]: Without dead ends: 31 [2018-06-24 23:53:52,177 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:52,177 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:53:52,181 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:53:52,181 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:53:52,182 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 367 transitions. [2018-06-24 23:53:52,182 INFO ]: Start accepts. Automaton has 31 states and 367 transitions. Word has length 8 [2018-06-24 23:53:52,182 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:52,182 INFO ]: Abstraction has 31 states and 367 transitions. [2018-06-24 23:53:52,182 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:52,182 INFO ]: Start isEmpty. Operand 31 states and 367 transitions. [2018-06-24 23:53:52,183 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 23:53:52,183 INFO ]: Found error trace [2018-06-24 23:53:52,183 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:52,183 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:52,184 INFO ]: Analyzing trace with hash 1182406954, now seen corresponding path program 1 times [2018-06-24 23:53:52,184 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:52,184 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:52,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:52,184 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:52,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:52,216 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:52,249 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 23:53:52,249 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:52,250 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:52,250 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:52,250 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:52,250 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:52,250 INFO ]: Start difference. First operand 31 states and 367 transitions. Second operand 3 states. [2018-06-24 23:53:52,764 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:52,764 INFO ]: Finished difference Result 31 states and 236 transitions. [2018-06-24 23:53:52,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:52,764 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 23:53:52,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:52,765 INFO ]: With dead ends: 31 [2018-06-24 23:53:52,765 INFO ]: Without dead ends: 31 [2018-06-24 23:53:52,765 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:52,765 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:53:52,768 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:53:52,768 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:53:52,769 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 236 transitions. [2018-06-24 23:53:52,769 INFO ]: Start accepts. Automaton has 31 states and 236 transitions. Word has length 8 [2018-06-24 23:53:52,769 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:52,769 INFO ]: Abstraction has 31 states and 236 transitions. [2018-06-24 23:53:52,769 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:52,769 INFO ]: Start isEmpty. Operand 31 states and 236 transitions. [2018-06-24 23:53:52,770 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 23:53:52,770 INFO ]: Found error trace [2018-06-24 23:53:52,770 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:52,770 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:52,770 INFO ]: Analyzing trace with hash -1336930100, now seen corresponding path program 1 times [2018-06-24 23:53:52,770 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:52,770 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:52,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:52,771 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:52,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:52,796 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:52,826 INFO ]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 23:53:52,826 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:52,826 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:52,827 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:52,827 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:52,827 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:52,827 INFO ]: Start difference. First operand 31 states and 236 transitions. Second operand 3 states. [2018-06-24 23:53:53,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:53,772 INFO ]: Finished difference Result 31 states and 160 transitions. [2018-06-24 23:53:53,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:53,772 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 23:53:53,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:53,773 INFO ]: With dead ends: 31 [2018-06-24 23:53:53,773 INFO ]: Without dead ends: 31 [2018-06-24 23:53:53,773 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:53,773 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:53:53,776 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:53:53,776 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:53:53,776 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 160 transitions. [2018-06-24 23:53:53,777 INFO ]: Start accepts. Automaton has 31 states and 160 transitions. Word has length 9 [2018-06-24 23:53:53,777 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:53,777 INFO ]: Abstraction has 31 states and 160 transitions. [2018-06-24 23:53:53,777 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:53,777 INFO ]: Start isEmpty. Operand 31 states and 160 transitions. [2018-06-24 23:53:53,777 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 23:53:53,777 INFO ]: Found error trace [2018-06-24 23:53:53,777 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:53,777 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:53,777 INFO ]: Analyzing trace with hash -1622032318, now seen corresponding path program 1 times [2018-06-24 23:53:53,778 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:53,778 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:53,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:53,778 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:53,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:53,805 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:53,882 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 23:53:53,882 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:53,882 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:53,882 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:53,882 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:53,882 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:53,883 INFO ]: Start difference. First operand 31 states and 160 transitions. Second operand 3 states. [2018-06-24 23:53:54,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:54,639 INFO ]: Finished difference Result 31 states and 105 transitions. [2018-06-24 23:53:54,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:54,656 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 23:53:54,656 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:54,656 INFO ]: With dead ends: 31 [2018-06-24 23:53:54,656 INFO ]: Without dead ends: 31 [2018-06-24 23:53:54,657 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:54,657 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:53:54,659 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:53:54,659 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:53:54,660 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2018-06-24 23:53:54,660 INFO ]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 9 [2018-06-24 23:53:54,660 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:54,660 INFO ]: Abstraction has 31 states and 105 transitions. [2018-06-24 23:53:54,660 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:54,660 INFO ]: Start isEmpty. Operand 31 states and 105 transitions. [2018-06-24 23:53:54,660 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 23:53:54,660 INFO ]: Found error trace [2018-06-24 23:53:54,660 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:54,660 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:54,660 INFO ]: Analyzing trace with hash -1652242587, now seen corresponding path program 1 times [2018-06-24 23:53:54,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:54,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:54,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:54,661 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:54,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:54,693 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:54,799 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 23:53:54,799 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:54,799 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:54,799 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:54,799 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:54,799 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:54,799 INFO ]: Start difference. First operand 31 states and 105 transitions. Second operand 3 states. [2018-06-24 23:53:55,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:55,448 INFO ]: Finished difference Result 50 states and 168 transitions. [2018-06-24 23:53:55,449 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:55,449 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 23:53:55,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:55,449 INFO ]: With dead ends: 50 [2018-06-24 23:53:55,449 INFO ]: Without dead ends: 49 [2018-06-24 23:53:55,450 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:55,450 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 23:53:55,454 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-24 23:53:55,454 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 23:53:55,455 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 167 transitions. [2018-06-24 23:53:55,455 INFO ]: Start accepts. Automaton has 49 states and 167 transitions. Word has length 10 [2018-06-24 23:53:55,455 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:55,455 INFO ]: Abstraction has 49 states and 167 transitions. [2018-06-24 23:53:55,455 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:55,455 INFO ]: Start isEmpty. Operand 49 states and 167 transitions. [2018-06-24 23:53:55,456 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 23:53:55,456 INFO ]: Found error trace [2018-06-24 23:53:55,456 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:55,456 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:55,456 INFO ]: Analyzing trace with hash 970959147, now seen corresponding path program 1 times [2018-06-24 23:53:55,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:55,456 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:55,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:55,457 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:55,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:55,501 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:55,619 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 23:53:55,619 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:55,619 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:55,619 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:55,619 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:55,619 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:55,619 INFO ]: Start difference. First operand 49 states and 167 transitions. Second operand 3 states. [2018-06-24 23:53:56,459 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:56,459 INFO ]: Finished difference Result 86 states and 262 transitions. [2018-06-24 23:53:56,459 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:56,459 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 23:53:56,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:56,460 INFO ]: With dead ends: 86 [2018-06-24 23:53:56,460 INFO ]: Without dead ends: 70 [2018-06-24 23:53:56,460 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:56,460 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-24 23:53:56,467 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-24 23:53:56,467 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-24 23:53:56,468 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 225 transitions. [2018-06-24 23:53:56,468 INFO ]: Start accepts. Automaton has 70 states and 225 transitions. Word has length 11 [2018-06-24 23:53:56,468 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:56,468 INFO ]: Abstraction has 70 states and 225 transitions. [2018-06-24 23:53:56,468 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:56,468 INFO ]: Start isEmpty. Operand 70 states and 225 transitions. [2018-06-24 23:53:56,469 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 23:53:56,469 INFO ]: Found error trace [2018-06-24 23:53:56,469 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:56,469 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:56,469 INFO ]: Analyzing trace with hash -707836462, now seen corresponding path program 1 times [2018-06-24 23:53:56,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:56,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:56,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:56,470 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:56,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:56,522 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:56,641 INFO ]: Checked inductivity of 55 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-24 23:53:56,641 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:56,641 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:56,641 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:56,641 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:56,641 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:56,641 INFO ]: Start difference. First operand 70 states and 225 transitions. Second operand 3 states. [2018-06-24 23:53:57,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:57,211 INFO ]: Finished difference Result 116 states and 319 transitions. [2018-06-24 23:53:57,211 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:57,211 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-24 23:53:57,211 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:57,212 INFO ]: With dead ends: 116 [2018-06-24 23:53:57,212 INFO ]: Without dead ends: 107 [2018-06-24 23:53:57,213 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:57,213 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-24 23:53:57,219 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-06-24 23:53:57,219 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-24 23:53:57,220 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 296 transitions. [2018-06-24 23:53:57,220 INFO ]: Start accepts. Automaton has 103 states and 296 transitions. Word has length 15 [2018-06-24 23:53:57,220 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:57,220 INFO ]: Abstraction has 103 states and 296 transitions. [2018-06-24 23:53:57,220 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:57,220 INFO ]: Start isEmpty. Operand 103 states and 296 transitions. [2018-06-24 23:53:57,221 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 23:53:57,221 INFO ]: Found error trace [2018-06-24 23:53:57,221 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:57,221 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:57,221 INFO ]: Analyzing trace with hash 221862830, now seen corresponding path program 1 times [2018-06-24 23:53:57,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:57,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:57,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:57,222 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:57,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:57,269 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:57,406 INFO ]: Checked inductivity of 55 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-24 23:53:57,406 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:57,406 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:57,406 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:57,406 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:57,406 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:57,406 INFO ]: Start difference. First operand 103 states and 296 transitions. Second operand 3 states. [2018-06-24 23:53:57,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:57,991 INFO ]: Finished difference Result 149 states and 459 transitions. [2018-06-24 23:53:57,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:57,992 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-24 23:53:57,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:57,994 INFO ]: With dead ends: 149 [2018-06-24 23:53:57,994 INFO ]: Without dead ends: 149 [2018-06-24 23:53:57,994 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:57,994 INFO ]: Start minimizeSevpa. Operand 149 states. [2018-06-24 23:53:58,004 INFO ]: Finished minimizeSevpa. Reduced states from 149 to 134. [2018-06-24 23:53:58,004 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-24 23:53:58,006 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 412 transitions. [2018-06-24 23:53:58,006 INFO ]: Start accepts. Automaton has 134 states and 412 transitions. Word has length 15 [2018-06-24 23:53:58,006 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:58,006 INFO ]: Abstraction has 134 states and 412 transitions. [2018-06-24 23:53:58,006 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:58,006 INFO ]: Start isEmpty. Operand 134 states and 412 transitions. [2018-06-24 23:53:58,007 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 23:53:58,007 INFO ]: Found error trace [2018-06-24 23:53:58,007 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:58,007 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:58,008 INFO ]: Analyzing trace with hash 832038856, now seen corresponding path program 1 times [2018-06-24 23:53:58,008 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:58,008 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:58,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:58,008 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:58,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:58,058 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:58,340 INFO ]: Checked inductivity of 55 backedges. 26 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 23:53:58,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:58,340 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:53:58,347 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:58,868 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:58,899 INFO ]: Computing forward predicates... [2018-06-24 23:53:59,043 INFO ]: Checked inductivity of 55 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-24 23:53:59,078 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 23:53:59,079 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-24 23:53:59,079 INFO ]: Interpolant automaton has 6 states [2018-06-24 23:53:59,079 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 23:53:59,079 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:53:59,079 INFO ]: Start difference. First operand 134 states and 412 transitions. Second operand 6 states. [2018-06-24 23:54:02,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:02,393 INFO ]: Finished difference Result 440 states and 1133 transitions. [2018-06-24 23:54:02,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 23:54:02,393 INFO ]: Start accepts. Automaton has 6 states. Word has length 15 [2018-06-24 23:54:02,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:02,396 INFO ]: With dead ends: 440 [2018-06-24 23:54:02,396 INFO ]: Without dead ends: 437 [2018-06-24 23:54:02,397 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-06-24 23:54:02,397 INFO ]: Start minimizeSevpa. Operand 437 states. [2018-06-24 23:54:02,425 INFO ]: Finished minimizeSevpa. Reduced states from 437 to 418. [2018-06-24 23:54:02,425 INFO ]: Start removeUnreachable. Operand 418 states. [2018-06-24 23:54:02,433 INFO ]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1095 transitions. [2018-06-24 23:54:02,433 INFO ]: Start accepts. Automaton has 418 states and 1095 transitions. Word has length 15 [2018-06-24 23:54:02,433 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:02,433 INFO ]: Abstraction has 418 states and 1095 transitions. [2018-06-24 23:54:02,433 INFO ]: Interpolant automaton has 6 states. [2018-06-24 23:54:02,433 INFO ]: Start isEmpty. Operand 418 states and 1095 transitions. [2018-06-24 23:54:02,439 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 23:54:02,439 INFO ]: Found error trace [2018-06-24 23:54:02,439 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:02,440 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:02,440 INFO ]: Analyzing trace with hash 1613102768, now seen corresponding path program 1 times [2018-06-24 23:54:02,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:02,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:02,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:02,440 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:02,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:02,486 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:02,614 INFO ]: Checked inductivity of 66 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-24 23:54:02,614 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:02,614 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:02,614 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:02,614 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:02,614 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:02,615 INFO ]: Start difference. First operand 418 states and 1095 transitions. Second operand 3 states. [2018-06-24 23:54:04,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:04,022 INFO ]: Finished difference Result 710 states and 1652 transitions. [2018-06-24 23:54:04,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:04,023 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-24 23:54:04,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:04,028 INFO ]: With dead ends: 710 [2018-06-24 23:54:04,028 INFO ]: Without dead ends: 709 [2018-06-24 23:54:04,028 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:04,029 INFO ]: Start minimizeSevpa. Operand 709 states. [2018-06-24 23:54:04,050 INFO ]: Finished minimizeSevpa. Reduced states from 709 to 709. [2018-06-24 23:54:04,050 INFO ]: Start removeUnreachable. Operand 709 states. [2018-06-24 23:54:04,055 INFO ]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1651 transitions. [2018-06-24 23:54:04,055 INFO ]: Start accepts. Automaton has 709 states and 1651 transitions. Word has length 16 [2018-06-24 23:54:04,055 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:04,055 INFO ]: Abstraction has 709 states and 1651 transitions. [2018-06-24 23:54:04,055 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:04,055 INFO ]: Start isEmpty. Operand 709 states and 1651 transitions. [2018-06-24 23:54:04,057 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:54:04,057 INFO ]: Found error trace [2018-06-24 23:54:04,057 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:04,057 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:04,057 INFO ]: Analyzing trace with hash 429675636, now seen corresponding path program 1 times [2018-06-24 23:54:04,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:04,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:04,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:04,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:04,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:04,115 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:04,370 INFO ]: Checked inductivity of 78 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 23:54:04,370 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:04,370 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-24 23:54:04,385 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-24 23:54:04,889 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:04,905 INFO ]: Computing forward predicates... [2018-06-24 23:54:04,917 INFO ]: Checked inductivity of 78 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-24 23:54:04,939 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 23:54:04,939 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-24 23:54:04,939 INFO ]: Interpolant automaton has 6 states [2018-06-24 23:54:04,939 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 23:54:04,939 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:54:04,939 INFO ]: Start difference. First operand 709 states and 1651 transitions. Second operand 6 states. [2018-06-24 23:54:06,929 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:06,929 INFO ]: Finished difference Result 1808 states and 4280 transitions. [2018-06-24 23:54:06,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 23:54:06,930 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-24 23:54:06,930 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:06,941 INFO ]: With dead ends: 1808 [2018-06-24 23:54:06,941 INFO ]: Without dead ends: 1805 [2018-06-24 23:54:06,941 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-06-24 23:54:06,943 INFO ]: Start minimizeSevpa. Operand 1805 states. [2018-06-24 23:54:06,991 INFO ]: Finished minimizeSevpa. Reduced states from 1805 to 1721. [2018-06-24 23:54:06,992 INFO ]: Start removeUnreachable. Operand 1721 states. [2018-06-24 23:54:07,000 INFO ]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 4161 transitions. [2018-06-24 23:54:07,000 INFO ]: Start accepts. Automaton has 1721 states and 4161 transitions. Word has length 17 [2018-06-24 23:54:07,000 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:07,000 INFO ]: Abstraction has 1721 states and 4161 transitions. [2018-06-24 23:54:07,000 INFO ]: Interpolant automaton has 6 states. [2018-06-24 23:54:07,000 INFO ]: Start isEmpty. Operand 1721 states and 4161 transitions. [2018-06-24 23:54:07,002 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 23:54:07,002 INFO ]: Found error trace [2018-06-24 23:54:07,002 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:07,002 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:07,003 INFO ]: Analyzing trace with hash 606750083, now seen corresponding path program 1 times [2018-06-24 23:54:07,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:07,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:07,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:07,003 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:07,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:07,059 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:07,298 INFO ]: Checked inductivity of 91 backedges. 51 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-24 23:54:07,299 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:07,299 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:54:07,305 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:07,756 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:07,774 INFO ]: Computing forward predicates... [2018-06-24 23:54:07,812 INFO ]: Checked inductivity of 91 backedges. 51 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-24 23:54:07,836 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:54:07,836 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 23:54:07,836 INFO ]: Interpolant automaton has 5 states [2018-06-24 23:54:07,836 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 23:54:07,836 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 23:54:07,836 INFO ]: Start difference. First operand 1721 states and 4161 transitions. Second operand 5 states. [2018-06-24 23:54:08,544 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:08,544 INFO ]: Finished difference Result 1705 states and 3934 transitions. [2018-06-24 23:54:08,547 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 23:54:08,547 INFO ]: Start accepts. Automaton has 5 states. Word has length 18 [2018-06-24 23:54:08,547 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:08,556 INFO ]: With dead ends: 1705 [2018-06-24 23:54:08,557 INFO ]: Without dead ends: 1611 [2018-06-24 23:54:08,557 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:54:08,558 INFO ]: Start minimizeSevpa. Operand 1611 states. [2018-06-24 23:54:08,604 INFO ]: Finished minimizeSevpa. Reduced states from 1611 to 1293. [2018-06-24 23:54:08,604 INFO ]: Start removeUnreachable. Operand 1293 states. [2018-06-24 23:54:08,610 INFO ]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 3010 transitions. [2018-06-24 23:54:08,610 INFO ]: Start accepts. Automaton has 1293 states and 3010 transitions. Word has length 18 [2018-06-24 23:54:08,610 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:08,610 INFO ]: Abstraction has 1293 states and 3010 transitions. [2018-06-24 23:54:08,610 INFO ]: Interpolant automaton has 5 states. [2018-06-24 23:54:08,610 INFO ]: Start isEmpty. Operand 1293 states and 3010 transitions. [2018-06-24 23:54:08,613 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 23:54:08,613 INFO ]: Found error trace [2018-06-24 23:54:08,613 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:08,613 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:08,613 INFO ]: Analyzing trace with hash 975940103, now seen corresponding path program 1 times [2018-06-24 23:54:08,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:08,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:08,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:08,614 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:08,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:08,714 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:08,806 INFO ]: Checked inductivity of 136 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-06-24 23:54:08,806 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:08,806 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:08,806 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:08,806 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:08,806 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:08,806 INFO ]: Start difference. First operand 1293 states and 3010 transitions. Second operand 3 states. [2018-06-24 23:54:09,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:09,608 INFO ]: Finished difference Result 1735 states and 3935 transitions. [2018-06-24 23:54:09,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:09,609 INFO ]: Start accepts. Automaton has 3 states. Word has length 21 [2018-06-24 23:54:09,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:09,616 INFO ]: With dead ends: 1735 [2018-06-24 23:54:09,616 INFO ]: Without dead ends: 1591 [2018-06-24 23:54:09,617 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:09,617 INFO ]: Start minimizeSevpa. Operand 1591 states. [2018-06-24 23:54:09,660 INFO ]: Finished minimizeSevpa. Reduced states from 1591 to 1543. [2018-06-24 23:54:09,660 INFO ]: Start removeUnreachable. Operand 1543 states. [2018-06-24 23:54:09,666 INFO ]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 3565 transitions. [2018-06-24 23:54:09,666 INFO ]: Start accepts. Automaton has 1543 states and 3565 transitions. Word has length 21 [2018-06-24 23:54:09,667 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:09,667 INFO ]: Abstraction has 1543 states and 3565 transitions. [2018-06-24 23:54:09,667 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:09,667 INFO ]: Start isEmpty. Operand 1543 states and 3565 transitions. [2018-06-24 23:54:09,670 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 23:54:09,670 INFO ]: Found error trace [2018-06-24 23:54:09,670 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:09,670 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:09,670 INFO ]: Analyzing trace with hash -571786638, now seen corresponding path program 1 times [2018-06-24 23:54:09,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:09,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:09,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:09,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:09,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:09,747 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:09,882 INFO ]: Checked inductivity of 190 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-24 23:54:09,882 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:09,882 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:09,882 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:09,883 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:09,883 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:09,883 INFO ]: Start difference. First operand 1543 states and 3565 transitions. Second operand 3 states. [2018-06-24 23:54:10,411 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:10,411 INFO ]: Finished difference Result 2022 states and 4163 transitions. [2018-06-24 23:54:10,411 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:10,411 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-24 23:54:10,411 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:10,417 INFO ]: With dead ends: 2022 [2018-06-24 23:54:10,417 INFO ]: Without dead ends: 1718 [2018-06-24 23:54:10,417 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:10,418 INFO ]: Start minimizeSevpa. Operand 1718 states. [2018-06-24 23:54:10,457 INFO ]: Finished minimizeSevpa. Reduced states from 1718 to 1487. [2018-06-24 23:54:10,457 INFO ]: Start removeUnreachable. Operand 1487 states. [2018-06-24 23:54:10,462 INFO ]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 3219 transitions. [2018-06-24 23:54:10,462 INFO ]: Start accepts. Automaton has 1487 states and 3219 transitions. Word has length 24 [2018-06-24 23:54:10,462 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:10,462 INFO ]: Abstraction has 1487 states and 3219 transitions. [2018-06-24 23:54:10,462 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:10,463 INFO ]: Start isEmpty. Operand 1487 states and 3219 transitions. [2018-06-24 23:54:10,465 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 23:54:10,465 INFO ]: Found error trace [2018-06-24 23:54:10,465 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:10,466 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:10,467 INFO ]: Analyzing trace with hash 1812647055, now seen corresponding path program 1 times [2018-06-24 23:54:10,467 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:10,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:10,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:10,468 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:10,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:10,508 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:10,600 INFO ]: Checked inductivity of 190 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-06-24 23:54:10,600 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:10,600 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:10,600 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:10,601 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:10,601 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:10,601 INFO ]: Start difference. First operand 1487 states and 3219 transitions. Second operand 3 states. [2018-06-24 23:54:11,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:11,325 INFO ]: Finished difference Result 1873 states and 3876 transitions. [2018-06-24 23:54:11,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:11,326 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-24 23:54:11,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:11,329 INFO ]: With dead ends: 1873 [2018-06-24 23:54:11,329 INFO ]: Without dead ends: 1220 [2018-06-24 23:54:11,330 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:11,330 INFO ]: Start minimizeSevpa. Operand 1220 states. [2018-06-24 23:54:11,351 INFO ]: Finished minimizeSevpa. Reduced states from 1220 to 657. [2018-06-24 23:54:11,351 INFO ]: Start removeUnreachable. Operand 657 states. [2018-06-24 23:54:11,354 INFO ]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1342 transitions. [2018-06-24 23:54:11,354 INFO ]: Start accepts. Automaton has 657 states and 1342 transitions. Word has length 24 [2018-06-24 23:54:11,354 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:11,354 INFO ]: Abstraction has 657 states and 1342 transitions. [2018-06-24 23:54:11,354 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:11,354 INFO ]: Start isEmpty. Operand 657 states and 1342 transitions. [2018-06-24 23:54:11,356 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 23:54:11,356 INFO ]: Found error trace [2018-06-24 23:54:11,356 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:11,356 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:11,356 INFO ]: Analyzing trace with hash 1711636072, now seen corresponding path program 1 times [2018-06-24 23:54:11,356 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:11,356 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:11,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:11,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:11,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:11,419 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:11,711 INFO ]: Checked inductivity of 210 backedges. 132 proven. 32 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-24 23:54:11,711 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:11,711 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 23:54:11,722 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:54:12,384 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:12,412 INFO ]: Computing forward predicates... [2018-06-24 23:54:12,443 INFO ]: Checked inductivity of 210 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-06-24 23:54:12,475 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 23:54:12,475 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-24 23:54:12,476 INFO ]: Interpolant automaton has 5 states [2018-06-24 23:54:12,476 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 23:54:12,476 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 23:54:12,476 INFO ]: Start difference. First operand 657 states and 1342 transitions. Second operand 5 states. [2018-06-24 23:54:13,012 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:13,012 INFO ]: Finished difference Result 1207 states and 2143 transitions. [2018-06-24 23:54:13,014 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 23:54:13,014 INFO ]: Start accepts. Automaton has 5 states. Word has length 25 [2018-06-24 23:54:13,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:13,015 INFO ]: With dead ends: 1207 [2018-06-24 23:54:13,015 INFO ]: Without dead ends: 701 [2018-06-24 23:54:13,016 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:54:13,016 INFO ]: Start minimizeSevpa. Operand 701 states. [2018-06-24 23:54:13,026 INFO ]: Finished minimizeSevpa. Reduced states from 701 to 489. [2018-06-24 23:54:13,026 INFO ]: Start removeUnreachable. Operand 489 states. [2018-06-24 23:54:13,028 INFO ]: Finished removeUnreachable. Reduced from 489 states to 489 states and 958 transitions. [2018-06-24 23:54:13,028 INFO ]: Start accepts. Automaton has 489 states and 958 transitions. Word has length 25 [2018-06-24 23:54:13,029 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:13,029 INFO ]: Abstraction has 489 states and 958 transitions. [2018-06-24 23:54:13,029 INFO ]: Interpolant automaton has 5 states. [2018-06-24 23:54:13,029 INFO ]: Start isEmpty. Operand 489 states and 958 transitions. [2018-06-24 23:54:13,030 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 23:54:13,030 INFO ]: Found error trace [2018-06-24 23:54:13,030 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:13,030 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:13,030 INFO ]: Analyzing trace with hash 384734062, now seen corresponding path program 1 times [2018-06-24 23:54:13,030 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:13,030 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:13,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:13,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:13,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:13,077 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:13,183 INFO ]: Checked inductivity of 276 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-24 23:54:13,183 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:13,183 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:13,183 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:13,183 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:13,183 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:13,184 INFO ]: Start difference. First operand 489 states and 958 transitions. Second operand 3 states. [2018-06-24 23:54:13,902 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:13,903 INFO ]: Finished difference Result 564 states and 1064 transitions. [2018-06-24 23:54:13,903 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:13,903 INFO ]: Start accepts. Automaton has 3 states. Word has length 28 [2018-06-24 23:54:13,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:13,904 INFO ]: With dead ends: 564 [2018-06-24 23:54:13,904 INFO ]: Without dead ends: 487 [2018-06-24 23:54:13,904 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:13,905 INFO ]: Start minimizeSevpa. Operand 487 states. [2018-06-24 23:54:13,913 INFO ]: Finished minimizeSevpa. Reduced states from 487 to 487. [2018-06-24 23:54:13,913 INFO ]: Start removeUnreachable. Operand 487 states. [2018-06-24 23:54:13,915 INFO ]: Finished removeUnreachable. Reduced from 487 states to 487 states and 919 transitions. [2018-06-24 23:54:13,915 INFO ]: Start accepts. Automaton has 487 states and 919 transitions. Word has length 28 [2018-06-24 23:54:13,915 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:13,915 INFO ]: Abstraction has 487 states and 919 transitions. [2018-06-24 23:54:13,915 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:13,915 INFO ]: Start isEmpty. Operand 487 states and 919 transitions. [2018-06-24 23:54:13,916 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 23:54:13,916 INFO ]: Found error trace [2018-06-24 23:54:13,916 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:13,917 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:13,917 INFO ]: Analyzing trace with hash -1551926671, now seen corresponding path program 1 times [2018-06-24 23:54:13,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:13,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:13,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:13,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:13,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:13,971 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:14,079 INFO ]: Checked inductivity of 276 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-24 23:54:14,079 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:14,080 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:14,080 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:14,080 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:14,080 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:14,080 INFO ]: Start difference. First operand 487 states and 919 transitions. Second operand 3 states. [2018-06-24 23:54:15,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:15,003 INFO ]: Finished difference Result 542 states and 1020 transitions. [2018-06-24 23:54:15,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:15,003 INFO ]: Start accepts. Automaton has 3 states. Word has length 28 [2018-06-24 23:54:15,003 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:15,004 INFO ]: With dead ends: 542 [2018-06-24 23:54:15,004 INFO ]: Without dead ends: 520 [2018-06-24 23:54:15,005 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:15,005 INFO ]: Start minimizeSevpa. Operand 520 states. [2018-06-24 23:54:15,012 INFO ]: Finished minimizeSevpa. Reduced states from 520 to 473. [2018-06-24 23:54:15,012 INFO ]: Start removeUnreachable. Operand 473 states. [2018-06-24 23:54:15,013 INFO ]: Finished removeUnreachable. Reduced from 473 states to 473 states and 871 transitions. [2018-06-24 23:54:15,013 INFO ]: Start accepts. Automaton has 473 states and 871 transitions. Word has length 28 [2018-06-24 23:54:15,013 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:15,013 INFO ]: Abstraction has 473 states and 871 transitions. [2018-06-24 23:54:15,013 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:15,013 INFO ]: Start isEmpty. Operand 473 states and 871 transitions. [2018-06-24 23:54:15,014 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 23:54:15,014 INFO ]: Found error trace [2018-06-24 23:54:15,014 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:15,014 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:15,015 INFO ]: Analyzing trace with hash 837399699, now seen corresponding path program 1 times [2018-06-24 23:54:15,015 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:15,015 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:15,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:15,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:15,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:15,116 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:15,258 INFO ]: Checked inductivity of 276 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-06-24 23:54:15,258 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:15,258 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:15,258 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:15,258 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:15,258 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:15,258 INFO ]: Start difference. First operand 473 states and 871 transitions. Second operand 3 states. [2018-06-24 23:54:15,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:15,644 INFO ]: Finished difference Result 473 states and 819 transitions. [2018-06-24 23:54:15,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:15,645 INFO ]: Start accepts. Automaton has 3 states. Word has length 28 [2018-06-24 23:54:15,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:15,645 INFO ]: With dead ends: 473 [2018-06-24 23:54:15,645 INFO ]: Without dead ends: 147 [2018-06-24 23:54:15,645 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:15,645 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-24 23:54:15,646 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 105. [2018-06-24 23:54:15,647 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-24 23:54:15,647 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 142 transitions. [2018-06-24 23:54:15,647 INFO ]: Start accepts. Automaton has 105 states and 142 transitions. Word has length 28 [2018-06-24 23:54:15,647 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:15,647 INFO ]: Abstraction has 105 states and 142 transitions. [2018-06-24 23:54:15,647 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:15,647 INFO ]: Start isEmpty. Operand 105 states and 142 transitions. [2018-06-24 23:54:15,647 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 23:54:15,647 INFO ]: Found error trace [2018-06-24 23:54:15,647 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:15,647 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:15,647 INFO ]: Analyzing trace with hash -647050565, now seen corresponding path program 1 times [2018-06-24 23:54:15,647 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:15,647 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:15,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:15,648 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:15,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:15,737 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:15,962 INFO ]: Checked inductivity of 435 backedges. 248 proven. 12 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-24 23:54:15,962 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:15,962 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:54:15,976 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:16,944 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:16,981 INFO ]: Computing forward predicates... [2018-06-24 23:54:17,003 INFO ]: Checked inductivity of 435 backedges. 248 proven. 12 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-06-24 23:54:17,027 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:54:17,027 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 23:54:17,028 INFO ]: Interpolant automaton has 4 states [2018-06-24 23:54:17,028 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 23:54:17,028 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 23:54:17,028 INFO ]: Start difference. First operand 105 states and 142 transitions. Second operand 4 states. [2018-06-24 23:54:17,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:17,238 INFO ]: Finished difference Result 160 states and 207 transitions. [2018-06-24 23:54:17,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 23:54:17,238 INFO ]: Start accepts. Automaton has 4 states. Word has length 34 [2018-06-24 23:54:17,238 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:17,238 INFO ]: With dead ends: 160 [2018-06-24 23:54:17,238 INFO ]: Without dead ends: 122 [2018-06-24 23:54:17,239 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 23:54:17,239 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-24 23:54:17,240 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 105. [2018-06-24 23:54:17,240 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-24 23:54:17,240 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2018-06-24 23:54:17,240 INFO ]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 34 [2018-06-24 23:54:17,241 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:17,241 INFO ]: Abstraction has 105 states and 138 transitions. [2018-06-24 23:54:17,241 INFO ]: Interpolant automaton has 4 states. [2018-06-24 23:54:17,241 INFO ]: Start isEmpty. Operand 105 states and 138 transitions. [2018-06-24 23:54:17,241 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 23:54:17,241 INFO ]: Found error trace [2018-06-24 23:54:17,241 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:17,241 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:17,241 INFO ]: Analyzing trace with hash 405124982, now seen corresponding path program 1 times [2018-06-24 23:54:17,241 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:17,241 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:17,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:17,242 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:17,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:17,340 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:17,509 INFO ]: Checked inductivity of 435 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-06-24 23:54:17,509 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:17,509 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:17,509 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:17,510 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:17,510 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:17,510 INFO ]: Start difference. First operand 105 states and 138 transitions. Second operand 3 states. [2018-06-24 23:54:18,977 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:18,977 INFO ]: Finished difference Result 127 states and 165 transitions. [2018-06-24 23:54:18,978 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:18,978 INFO ]: Start accepts. Automaton has 3 states. Word has length 34 [2018-06-24 23:54:18,978 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:18,978 INFO ]: With dead ends: 127 [2018-06-24 23:54:18,978 INFO ]: Without dead ends: 113 [2018-06-24 23:54:18,978 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:18,978 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-24 23:54:18,980 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 105. [2018-06-24 23:54:18,980 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-24 23:54:18,980 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2018-06-24 23:54:18,980 INFO ]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 34 [2018-06-24 23:54:18,980 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:18,980 INFO ]: Abstraction has 105 states and 136 transitions. [2018-06-24 23:54:18,980 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:18,980 INFO ]: Start isEmpty. Operand 105 states and 136 transitions. [2018-06-24 23:54:18,980 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 23:54:18,980 INFO ]: Found error trace [2018-06-24 23:54:18,981 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:18,981 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:18,981 INFO ]: Analyzing trace with hash 720045643, now seen corresponding path program 1 times [2018-06-24 23:54:18,981 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:18,981 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:18,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:18,981 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:18,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:19,311 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:20,565 INFO ]: Checked inductivity of 435 backedges. 152 proven. 233 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-24 23:54:20,566 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:20,566 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 23:54:20,583 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:54:21,577 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:21,613 INFO ]: Computing forward predicates... [2018-06-24 23:54:21,681 INFO ]: Checked inductivity of 435 backedges. 131 proven. 213 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-24 23:54:21,709 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:54:21,709 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2018-06-24 23:54:21,709 INFO ]: Interpolant automaton has 10 states [2018-06-24 23:54:21,709 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 23:54:21,709 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 23:54:21,709 INFO ]: Start difference. First operand 105 states and 136 transitions. Second operand 10 states. [2018-06-24 23:54:22,380 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:22,380 INFO ]: Finished difference Result 187 states and 233 transitions. [2018-06-24 23:54:22,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 23:54:22,380 INFO ]: Start accepts. Automaton has 10 states. Word has length 34 [2018-06-24 23:54:22,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:22,380 INFO ]: With dead ends: 187 [2018-06-24 23:54:22,380 INFO ]: Without dead ends: 160 [2018-06-24 23:54:22,381 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-06-24 23:54:22,381 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-24 23:54:22,382 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 127. [2018-06-24 23:54:22,382 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-24 23:54:22,383 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 162 transitions. [2018-06-24 23:54:22,383 INFO ]: Start accepts. Automaton has 127 states and 162 transitions. Word has length 34 [2018-06-24 23:54:22,383 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:22,383 INFO ]: Abstraction has 127 states and 162 transitions. [2018-06-24 23:54:22,383 INFO ]: Interpolant automaton has 10 states. [2018-06-24 23:54:22,383 INFO ]: Start isEmpty. Operand 127 states and 162 transitions. [2018-06-24 23:54:22,383 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-24 23:54:22,383 INFO ]: Found error trace [2018-06-24 23:54:22,383 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:22,383 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:22,383 INFO ]: Analyzing trace with hash 1153544832, now seen corresponding path program 1 times [2018-06-24 23:54:22,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:22,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:22,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:22,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:22,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:22,504 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:23,620 INFO ]: Checked inductivity of 1035 backedges. 571 proven. 214 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-06-24 23:54:23,620 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:23,620 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:54:23,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:25,139 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:25,193 INFO ]: Computing forward predicates... [2018-06-24 23:54:25,264 INFO ]: Checked inductivity of 1035 backedges. 631 proven. 154 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-06-24 23:54:25,311 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:54:25,311 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-24 23:54:25,311 INFO ]: Interpolant automaton has 13 states [2018-06-24 23:54:25,311 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 23:54:25,311 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-24 23:54:25,311 INFO ]: Start difference. First operand 127 states and 162 transitions. Second operand 13 states. [2018-06-24 23:54:26,050 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:26,050 INFO ]: Finished difference Result 174 states and 216 transitions. [2018-06-24 23:54:26,050 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 23:54:26,051 INFO ]: Start accepts. Automaton has 13 states. Word has length 50 [2018-06-24 23:54:26,051 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:26,051 INFO ]: With dead ends: 174 [2018-06-24 23:54:26,051 INFO ]: Without dead ends: 163 [2018-06-24 23:54:26,051 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-06-24 23:54:26,051 INFO ]: Start minimizeSevpa. Operand 163 states. [2018-06-24 23:54:26,053 INFO ]: Finished minimizeSevpa. Reduced states from 163 to 141. [2018-06-24 23:54:26,053 INFO ]: Start removeUnreachable. Operand 141 states. [2018-06-24 23:54:26,053 INFO ]: Finished removeUnreachable. Reduced from 141 states to 141 states and 176 transitions. [2018-06-24 23:54:26,053 INFO ]: Start accepts. Automaton has 141 states and 176 transitions. Word has length 50 [2018-06-24 23:54:26,053 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:26,053 INFO ]: Abstraction has 141 states and 176 transitions. [2018-06-24 23:54:26,053 INFO ]: Interpolant automaton has 13 states. [2018-06-24 23:54:26,053 INFO ]: Start isEmpty. Operand 141 states and 176 transitions. [2018-06-24 23:54:26,054 INFO ]: Finished isEmpty. Found accepting run of length 67 [2018-06-24 23:54:26,054 INFO ]: Found error trace [2018-06-24 23:54:26,054 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:26,054 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:26,054 INFO ]: Analyzing trace with hash 1392501257, now seen corresponding path program 1 times [2018-06-24 23:54:26,054 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:26,054 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:26,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:26,054 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:26,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:26,182 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:27,019 INFO ]: Checked inductivity of 1891 backedges. 1070 proven. 91 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2018-06-24 23:54:27,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:27,019 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 23:54:27,188 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:54:29,144 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:29,220 INFO ]: Computing forward predicates... [2018-06-24 23:54:30,201 INFO ]: Checked inductivity of 1891 backedges. 1104 proven. 57 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2018-06-24 23:54:30,249 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:54:30,249 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-24 23:54:30,249 INFO ]: Interpolant automaton has 12 states [2018-06-24 23:54:30,249 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 23:54:30,249 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-24 23:54:30,249 INFO ]: Start difference. First operand 141 states and 176 transitions. Second operand 12 states. [2018-06-24 23:54:31,191 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:31,191 INFO ]: Finished difference Result 194 states and 243 transitions. [2018-06-24 23:54:31,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 23:54:31,191 INFO ]: Start accepts. Automaton has 12 states. Word has length 66 [2018-06-24 23:54:31,192 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:31,192 INFO ]: With dead ends: 194 [2018-06-24 23:54:31,192 INFO ]: Without dead ends: 169 [2018-06-24 23:54:31,192 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-24 23:54:31,192 INFO ]: Start minimizeSevpa. Operand 169 states. [2018-06-24 23:54:31,193 INFO ]: Finished minimizeSevpa. Reduced states from 169 to 130. [2018-06-24 23:54:31,193 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-24 23:54:31,194 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2018-06-24 23:54:31,194 INFO ]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 66 [2018-06-24 23:54:31,194 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:31,194 INFO ]: Abstraction has 130 states and 159 transitions. [2018-06-24 23:54:31,194 INFO ]: Interpolant automaton has 12 states. [2018-06-24 23:54:31,194 INFO ]: Start isEmpty. Operand 130 states and 159 transitions. [2018-06-24 23:54:31,194 INFO ]: Finished isEmpty. Found accepting run of length 68 [2018-06-24 23:54:31,194 INFO ]: Found error trace [2018-06-24 23:54:31,194 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:31,195 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:31,195 INFO ]: Analyzing trace with hash -1622397506, now seen corresponding path program 1 times [2018-06-24 23:54:31,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:31,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:31,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:31,195 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:31,195 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:31,376 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:31,596 INFO ]: Checked inductivity of 1953 backedges. 500 proven. 10 refuted. 0 times theorem prover too weak. 1443 trivial. 0 not checked. [2018-06-24 23:54:31,596 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:31,596 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) [2018-06-24 23:54:31,607 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:54:33,760 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:33,829 INFO ]: Computing forward predicates... [2018-06-24 23:54:34,063 INFO ]: Checked inductivity of 1953 backedges. 500 proven. 10 refuted. 0 times theorem prover too weak. 1443 trivial. 0 not checked. [2018-06-24 23:54:34,113 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:54:34,113 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 23:54:34,113 INFO ]: Interpolant automaton has 6 states [2018-06-24 23:54:34,113 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 23:54:34,113 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:54:34,114 INFO ]: Start difference. First operand 130 states and 159 transitions. Second operand 6 states. [2018-06-24 23:54:34,799 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:34,799 INFO ]: Finished difference Result 152 states and 183 transitions. [2018-06-24 23:54:34,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 23:54:34,799 INFO ]: Start accepts. Automaton has 6 states. Word has length 67 [2018-06-24 23:54:34,800 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:34,800 INFO ]: With dead ends: 152 [2018-06-24 23:54:34,800 INFO ]: Without dead ends: 129 [2018-06-24 23:54:34,800 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:54:34,800 INFO ]: Start minimizeSevpa. Operand 129 states. [2018-06-24 23:54:34,802 INFO ]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-06-24 23:54:34,802 INFO ]: Start removeUnreachable. Operand 129 states. [2018-06-24 23:54:34,802 INFO ]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2018-06-24 23:54:34,802 INFO ]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 67 [2018-06-24 23:54:34,802 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:34,802 INFO ]: Abstraction has 129 states and 153 transitions. [2018-06-24 23:54:34,802 INFO ]: Interpolant automaton has 6 states. [2018-06-24 23:54:34,802 INFO ]: Start isEmpty. Operand 129 states and 153 transitions. [2018-06-24 23:54:34,802 INFO ]: Finished isEmpty. Found accepting run of length 68 [2018-06-24 23:54:34,802 INFO ]: Found error trace [2018-06-24 23:54:34,803 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:34,803 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:34,803 INFO ]: Analyzing trace with hash -1848255682, now seen corresponding path program 1 times [2018-06-24 23:54:34,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:34,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:34,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:34,803 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:34,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:34,876 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-24 23:54:35,088 WARN ]: Removed 1 from assertion stack [2018-06-24 23:54:35,088 WARN ]: Verification canceled [2018-06-24 23:54:35,090 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 23:54:35,091 WARN ]: Timeout [2018-06-24 23:54:35,092 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 11:54:35 BasicIcfg [2018-06-24 23:54:35,092 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 23:54:35,094 INFO ]: Toolchain (without parser) took 54758.42 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 957.3 MB). Free memory was 192.0 MB in the beginning and 303.8 MB in the end (delta: -111.9 MB). Peak memory consumption was 845.5 MB. Max. memory is 3.6 GB. [2018-06-24 23:54:35,095 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 23:54:35,095 INFO ]: ChcToBoogie took 138.36 ms. Allocated memory was 309.3 MB in the beginning and 323.5 MB in the end (delta: 14.2 MB). Free memory was 192.0 MB in the beginning and 295.6 MB in the end (delta: -103.6 MB). Peak memory consumption was 5.8 MB. Max. memory is 3.6 GB. [2018-06-24 23:54:35,096 INFO ]: Boogie Preprocessor took 82.60 ms. Allocated memory is still 323.5 MB. Free memory was 295.6 MB in the beginning and 291.1 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 3.6 GB. [2018-06-24 23:54:35,096 INFO ]: RCFGBuilder took 784.85 ms. Allocated memory is still 323.5 MB. Free memory was 291.1 MB in the beginning and 218.1 MB in the end (delta: 73.0 MB). Peak memory consumption was 73.0 MB. Max. memory is 3.6 GB. [2018-06-24 23:54:35,096 INFO ]: BlockEncodingV2 took 4139.48 ms. Allocated memory was 323.5 MB in the beginning and 374.3 MB in the end (delta: 50.9 MB). Free memory was 218.1 MB in the beginning and 248.3 MB in the end (delta: -30.1 MB). Peak memory consumption was 52.3 MB. Max. memory is 3.6 GB. [2018-06-24 23:54:35,097 INFO ]: TraceAbstraction took 49600.11 ms. Allocated memory was 374.3 MB in the beginning and 1.3 GB in the end (delta: 892.3 MB). Free memory was 248.3 MB in the beginning and 303.8 MB in the end (delta: -55.6 MB). Peak memory consumption was 836.7 MB. Max. memory is 3.6 GB. [2018-06-24 23:54:35,102 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 105 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 138.36 ms. Allocated memory was 309.3 MB in the beginning and 323.5 MB in the end (delta: 14.2 MB). Free memory was 192.0 MB in the beginning and 295.6 MB in the end (delta: -103.6 MB). Peak memory consumption was 5.8 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 82.60 ms. Allocated memory is still 323.5 MB. Free memory was 295.6 MB in the beginning and 291.1 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 3.6 GB. * RCFGBuilder took 784.85 ms. Allocated memory is still 323.5 MB. Free memory was 291.1 MB in the beginning and 218.1 MB in the end (delta: 73.0 MB). Peak memory consumption was 73.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 4139.48 ms. Allocated memory was 323.5 MB in the beginning and 374.3 MB in the end (delta: 50.9 MB). Free memory was 218.1 MB in the beginning and 248.3 MB in the end (delta: -30.1 MB). Peak memory consumption was 52.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 49600.11 ms. Allocated memory was 374.3 MB in the beginning and 1.3 GB in the end (delta: 892.3 MB). Free memory was 248.3 MB in the beginning and 303.8 MB in the end (delta: -55.6 MB). Peak memory consumption was 836.7 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 68 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 4. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 49.5s OverallTime, 32 OverallIterations, 4 TraceHistogramMax, 27.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 5 SDslu, 242 SDs, 0 SdLazy, 9559 SolverSat, 2805 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 594 GetRequests, 482 SyntacticMatches, 12 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1721occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 1702 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 3.9s SsaConstructionTime, 7.6s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 976 NumberOfCodeBlocks, 976 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 936 ConstructedInterpolants, 0 QuantifiedInterpolants, 64992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 79626 ConjunctsInSsa, 401 ConjunctsInUnsatCore, 40 InterpolantComputations, 25 PerfectInterpolantSequences, 13273/14396 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/mem_slave_tlm.3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_23-54-35-122.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_23-54-35-122.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_23-54-35-122.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_23-54-35-122.csv Completed graceful shutdown