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.1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 23:52:40,965 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 23:52:40,968 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 23:52:40,979 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 23:52:40,979 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 23:52:40,980 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 23:52:40,981 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 23:52:40,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 23:52:40,987 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 23:52:40,988 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 23:52:40,990 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 23:52:40,990 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 23:52:40,991 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 23:52:40,992 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 23:52:40,992 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 23:52:40,997 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 23:52:40,998 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 23:52:41,012 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 23:52:41,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 23:52:41,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 23:52:41,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 23:52:41,018 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 23:52:41,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 23:52:41,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 23:52:41,019 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 23:52:41,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 23:52:41,024 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 23:52:41,025 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 23:52:41,026 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 23:52:41,027 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 23:52:41,027 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 23:52:41,028 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 23:52:41,028 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 23:52:41,029 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 23:52:41,030 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 23:52:41,030 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:52:41,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 23:52:41,044 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 23:52:41,044 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 23:52:41,045 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 23:52:41,046 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 23:52:41,046 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 23:52:41,046 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 23:52:41,046 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 23:52:41,046 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 23:52:41,047 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 23:52:41,047 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 23:52:41,047 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 23:52:41,047 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 23:52:41,047 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 23:52:41,047 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 23:52:41,049 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 23:52:41,049 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 23:52:41,049 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 23:52:41,050 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 23:52:41,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 23:52:41,050 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 23:52:41,051 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 23:52:41,052 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 23:52:41,092 INFO ]: Repository-Root is: /tmp [2018-06-24 23:52:41,109 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 23:52:41,112 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 23:52:41,113 INFO ]: Initializing SmtParser... [2018-06-24 23:52:41,114 INFO ]: SmtParser initialized [2018-06-24 23:52:41,114 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.1.smt2 [2018-06-24 23:52:41,115 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:52:41,208 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.1.smt2 unknown [2018-06-24 23:52:42,172 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.1.smt2 [2018-06-24 23:52:42,177 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 23:52:42,183 INFO ]: Walking toolchain with 5 elements. [2018-06-24 23:52:42,184 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 23:52:42,184 INFO ]: Initializing ChcToBoogie... [2018-06-24 23:52:42,184 INFO ]: ChcToBoogie initialized [2018-06-24 23:52:42,187 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 11:52:42" (1/1) ... [2018-06-24 23:52:42,272 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:42 Unit [2018-06-24 23:52:42,272 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 23:52:42,273 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 23:52:42,273 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 23:52:42,273 INFO ]: Boogie Preprocessor initialized [2018-06-24 23:52:42,293 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:42" (1/1) ... [2018-06-24 23:52:42,293 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:42" (1/1) ... [2018-06-24 23:52:42,329 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:42" (1/1) ... [2018-06-24 23:52:42,329 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:42" (1/1) ... [2018-06-24 23:52:42,354 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:42" (1/1) ... [2018-06-24 23:52:42,356 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:42" (1/1) ... [2018-06-24 23:52:42,361 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:42" (1/1) ... [2018-06-24 23:52:42,377 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 23:52:42,377 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 23:52:42,377 INFO ]: Initializing RCFGBuilder... [2018-06-24 23:52:42,377 INFO ]: RCFGBuilder initialized [2018-06-24 23:52:42,378 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:42" (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:52:42,401 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 23:52:42,401 INFO ]: Found specification of procedure gotoProc [2018-06-24 23:52:42,401 INFO ]: Found implementation of procedure gotoProc [2018-06-24 23:52:42,401 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 23:52:42,401 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 23:52:42,401 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:52:42,999 INFO ]: Using library mode [2018-06-24 23:52:43,000 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:52:42 BoogieIcfgContainer [2018-06-24 23:52:43,000 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 23:52:43,000 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 23:52:43,000 INFO ]: Initializing BlockEncodingV2... [2018-06-24 23:52:43,001 INFO ]: BlockEncodingV2 initialized [2018-06-24 23:52:43,001 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:52:42" (1/1) ... [2018-06-24 23:52:43,023 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-24 23:52:43,025 INFO ]: Using Remove infeasible edges [2018-06-24 23:52:43,026 INFO ]: Using Maximize final states [2018-06-24 23:52:43,026 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 23:52:43,026 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 23:52:43,030 INFO ]: Using Remove sink states [2018-06-24 23:52:43,031 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 23:52:43,031 INFO ]: Using Use SBE [2018-06-24 23:52:43,086 WARN ]: expecting exponential blowup for input size 6 [2018-06-24 23:52:46,618 INFO ]: SBE split 1 edges [2018-06-24 23:52:46,626 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 23:52:46,628 INFO ]: 0 new accepting states [2018-06-24 23:52:46,682 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 23:52:46,684 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 23:52:46,692 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 23:52:46,692 INFO ]: 0 new accepting states [2018-06-24 23:52:46,692 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 23:52:46,692 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 23:52:46,697 INFO ]: Encoded RCFG 6 locations, 93 edges [2018-06-24 23:52:46,698 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 11:52:46 BasicIcfg [2018-06-24 23:52:46,698 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 23:52:46,700 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 23:52:46,700 INFO ]: Initializing TraceAbstraction... [2018-06-24 23:52:46,704 INFO ]: TraceAbstraction initialized [2018-06-24 23:52:46,704 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 11:52:42" (1/4) ... [2018-06-24 23:52:46,705 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d1be28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 11:52:46, skipping insertion in model container [2018-06-24 23:52:46,705 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:52:42" (2/4) ... [2018-06-24 23:52:46,705 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d1be28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 11:52:46, skipping insertion in model container [2018-06-24 23:52:46,705 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:52:42" (3/4) ... [2018-06-24 23:52:46,705 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d1be28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 11:52:46, skipping insertion in model container [2018-06-24 23:52:46,705 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 11:52:46" (4/4) ... [2018-06-24 23:52:46,707 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 23:52:46,716 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 23:52:46,725 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 23:52:46,782 INFO ]: Using default assertion order modulation [2018-06-24 23:52:46,783 INFO ]: Interprodecural is true [2018-06-24 23:52:46,783 INFO ]: Hoare is false [2018-06-24 23:52:46,783 INFO ]: Compute interpolants for FPandBP [2018-06-24 23:52:46,783 INFO ]: Backedges is TWOTRACK [2018-06-24 23:52:46,783 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 23:52:46,783 INFO ]: Difference is false [2018-06-24 23:52:46,783 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 23:52:46,783 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 23:52:46,796 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 23:52:46,812 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 23:52:46,812 INFO ]: Found error trace [2018-06-24 23:52:46,813 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 23:52:46,813 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:46,818 INFO ]: Analyzing trace with hash 38108738, now seen corresponding path program 1 times [2018-06-24 23:52:46,820 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:46,821 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:46,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:46,867 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:46,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:46,956 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:47,100 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:52:47,104 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:47,104 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:47,106 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:47,121 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:47,122 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:47,124 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 23:52:48,505 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:48,505 INFO ]: Finished difference Result 7 states and 132 transitions. [2018-06-24 23:52:48,506 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:48,507 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 23:52:48,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:48,515 INFO ]: With dead ends: 7 [2018-06-24 23:52:48,515 INFO ]: Without dead ends: 7 [2018-06-24 23:52:48,517 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:52:48,536 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 23:52:48,558 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 23:52:48,560 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 23:52:48,561 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2018-06-24 23:52:48,562 INFO ]: Start accepts. Automaton has 7 states and 132 transitions. Word has length 5 [2018-06-24 23:52:48,563 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:48,563 INFO ]: Abstraction has 7 states and 132 transitions. [2018-06-24 23:52:48,564 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:48,564 INFO ]: Start isEmpty. Operand 7 states and 132 transitions. [2018-06-24 23:52:48,564 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 23:52:48,564 INFO ]: Found error trace [2018-06-24 23:52:48,564 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 23:52:48,564 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:48,564 INFO ]: Analyzing trace with hash 1178806128, now seen corresponding path program 1 times [2018-06-24 23:52:48,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:48,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:48,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:48,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:48,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:48,605 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:48,692 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:52:48,692 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:48,692 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:48,694 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:48,694 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:48,694 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:48,694 INFO ]: Start difference. First operand 7 states and 132 transitions. Second operand 3 states. [2018-06-24 23:52:49,835 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:49,835 INFO ]: Finished difference Result 9 states and 179 transitions. [2018-06-24 23:52:49,836 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:49,836 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 23:52:49,836 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:49,837 INFO ]: With dead ends: 9 [2018-06-24 23:52:49,837 INFO ]: Without dead ends: 9 [2018-06-24 23:52:49,837 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:52:49,838 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 23:52:49,841 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 23:52:49,841 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 23:52:49,842 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2018-06-24 23:52:49,842 INFO ]: Start accepts. Automaton has 9 states and 179 transitions. Word has length 6 [2018-06-24 23:52:49,842 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:49,842 INFO ]: Abstraction has 9 states and 179 transitions. [2018-06-24 23:52:49,842 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:49,842 INFO ]: Start isEmpty. Operand 9 states and 179 transitions. [2018-06-24 23:52:49,843 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 23:52:49,843 INFO ]: Found error trace [2018-06-24 23:52:49,843 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:52:49,843 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:49,843 INFO ]: Analyzing trace with hash -2032265823, now seen corresponding path program 1 times [2018-06-24 23:52:49,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:49,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:49,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:49,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:49,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:49,886 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:49,950 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:52:49,950 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:49,950 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:49,950 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:49,950 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:49,950 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:49,950 INFO ]: Start difference. First operand 9 states and 179 transitions. Second operand 3 states. [2018-06-24 23:52:50,612 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:50,612 INFO ]: Finished difference Result 13 states and 273 transitions. [2018-06-24 23:52:50,612 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:50,613 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 23:52:50,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:50,614 INFO ]: With dead ends: 13 [2018-06-24 23:52:50,614 INFO ]: Without dead ends: 13 [2018-06-24 23:52:50,614 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:52:50,614 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 23:52:50,618 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 23:52:50,618 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 23:52:50,619 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 273 transitions. [2018-06-24 23:52:50,619 INFO ]: Start accepts. Automaton has 13 states and 273 transitions. Word has length 7 [2018-06-24 23:52:50,620 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:50,620 INFO ]: Abstraction has 13 states and 273 transitions. [2018-06-24 23:52:50,620 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:50,620 INFO ]: Start isEmpty. Operand 13 states and 273 transitions. [2018-06-24 23:52:50,620 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 23:52:50,620 INFO ]: Found error trace [2018-06-24 23:52:50,620 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:52:50,620 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:50,620 INFO ]: Analyzing trace with hash -2032891434, now seen corresponding path program 1 times [2018-06-24 23:52:50,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:50,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:50,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:50,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:50,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:50,662 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:50,754 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:52:50,754 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:50,754 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:50,755 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:50,755 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:50,755 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:50,755 INFO ]: Start difference. First operand 13 states and 273 transitions. Second operand 3 states. [2018-06-24 23:52:51,304 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:51,304 INFO ]: Finished difference Result 20 states and 436 transitions. [2018-06-24 23:52:51,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:51,305 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 23:52:51,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:51,306 INFO ]: With dead ends: 20 [2018-06-24 23:52:51,306 INFO ]: Without dead ends: 20 [2018-06-24 23:52:51,307 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:52:51,307 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 23:52:51,312 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 23:52:51,312 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 23:52:51,314 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 436 transitions. [2018-06-24 23:52:51,314 INFO ]: Start accepts. Automaton has 20 states and 436 transitions. Word has length 7 [2018-06-24 23:52:51,314 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:51,314 INFO ]: Abstraction has 20 states and 436 transitions. [2018-06-24 23:52:51,314 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:51,314 INFO ]: Start isEmpty. Operand 20 states and 436 transitions. [2018-06-24 23:52:51,315 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 23:52:51,315 INFO ]: Found error trace [2018-06-24 23:52:51,315 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:52:51,315 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:51,315 INFO ]: Analyzing trace with hash -2114161282, now seen corresponding path program 1 times [2018-06-24 23:52:51,315 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:51,315 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:51,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:51,316 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:51,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:51,336 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:51,381 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:52:51,381 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:51,381 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:51,381 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:51,381 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:51,382 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:51,382 INFO ]: Start difference. First operand 20 states and 436 transitions. Second operand 3 states. [2018-06-24 23:52:51,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:51,783 INFO ]: Finished difference Result 20 states and 276 transitions. [2018-06-24 23:52:51,784 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:51,784 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 23:52:51,784 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:51,785 INFO ]: With dead ends: 20 [2018-06-24 23:52:51,785 INFO ]: Without dead ends: 20 [2018-06-24 23:52:51,785 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:52:51,785 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 23:52:51,788 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 23:52:51,789 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 23:52:51,789 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 276 transitions. [2018-06-24 23:52:51,789 INFO ]: Start accepts. Automaton has 20 states and 276 transitions. Word has length 7 [2018-06-24 23:52:51,790 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:51,790 INFO ]: Abstraction has 20 states and 276 transitions. [2018-06-24 23:52:51,790 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:51,790 INFO ]: Start isEmpty. Operand 20 states and 276 transitions. [2018-06-24 23:52:51,790 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 23:52:51,790 INFO ]: Found error trace [2018-06-24 23:52:51,790 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:52:51,790 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:51,790 INFO ]: Analyzing trace with hash 978205560, now seen corresponding path program 1 times [2018-06-24 23:52:51,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:51,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:51,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:51,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:51,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:51,813 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:51,885 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:52:51,885 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:51,885 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:51,885 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:51,885 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:51,885 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:51,885 INFO ]: Start difference. First operand 20 states and 276 transitions. Second operand 3 states. [2018-06-24 23:52:52,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:52,448 INFO ]: Finished difference Result 31 states and 359 transitions. [2018-06-24 23:52:52,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:52,448 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 23:52:52,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:52,449 INFO ]: With dead ends: 31 [2018-06-24 23:52:52,449 INFO ]: Without dead ends: 31 [2018-06-24 23:52:52,450 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:52:52,450 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:52:52,454 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:52:52,454 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:52:52,455 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 359 transitions. [2018-06-24 23:52:52,455 INFO ]: Start accepts. Automaton has 31 states and 359 transitions. Word has length 8 [2018-06-24 23:52:52,455 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:52,455 INFO ]: Abstraction has 31 states and 359 transitions. [2018-06-24 23:52:52,455 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:52,455 INFO ]: Start isEmpty. Operand 31 states and 359 transitions. [2018-06-24 23:52:52,456 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 23:52:52,456 INFO ]: Found error trace [2018-06-24 23:52:52,456 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:52:52,456 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:52,456 INFO ]: Analyzing trace with hash -1118365856, now seen corresponding path program 1 times [2018-06-24 23:52:52,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:52,456 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:52,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:52,457 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:52,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:52,501 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:52,561 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:52:52,561 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:52,561 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:52,561 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:52,561 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:52,561 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:52,562 INFO ]: Start difference. First operand 31 states and 359 transitions. Second operand 3 states. [2018-06-24 23:52:52,974 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:52,974 INFO ]: Finished difference Result 31 states and 247 transitions. [2018-06-24 23:52:52,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:52,974 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 23:52:52,974 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:52,975 INFO ]: With dead ends: 31 [2018-06-24 23:52:52,975 INFO ]: Without dead ends: 31 [2018-06-24 23:52:52,975 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:52:52,976 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:52:52,982 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:52:52,982 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:52:52,983 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 247 transitions. [2018-06-24 23:52:52,983 INFO ]: Start accepts. Automaton has 31 states and 247 transitions. Word has length 8 [2018-06-24 23:52:52,983 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:52,983 INFO ]: Abstraction has 31 states and 247 transitions. [2018-06-24 23:52:52,983 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:52,983 INFO ]: Start isEmpty. Operand 31 states and 247 transitions. [2018-06-24 23:52:52,984 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 23:52:52,984 INFO ]: Found error trace [2018-06-24 23:52:52,984 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:52:52,984 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:52,984 INFO ]: Analyzing trace with hash 3378354, now seen corresponding path program 1 times [2018-06-24 23:52:52,984 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:52,984 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:52,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:52,985 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:52,985 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:53,015 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:53,088 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:52:53,088 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:53,088 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:53,088 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:53,089 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:53,089 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:53,089 INFO ]: Start difference. First operand 31 states and 247 transitions. Second operand 3 states. [2018-06-24 23:52:53,622 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:53,623 INFO ]: Finished difference Result 31 states and 175 transitions. [2018-06-24 23:52:53,623 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:53,623 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 23:52:53,623 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:53,624 INFO ]: With dead ends: 31 [2018-06-24 23:52:53,624 INFO ]: Without dead ends: 31 [2018-06-24 23:52:53,624 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:53,624 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:52:53,628 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:52:53,628 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:52:53,629 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 175 transitions. [2018-06-24 23:52:53,629 INFO ]: Start accepts. Automaton has 31 states and 175 transitions. Word has length 9 [2018-06-24 23:52:53,629 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:53,629 INFO ]: Abstraction has 31 states and 175 transitions. [2018-06-24 23:52:53,629 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:53,629 INFO ]: Start isEmpty. Operand 31 states and 175 transitions. [2018-06-24 23:52:53,630 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 23:52:53,630 INFO ]: Found error trace [2018-06-24 23:52:53,630 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:52:53,630 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:53,630 INFO ]: Analyzing trace with hash -2039592231, now seen corresponding path program 1 times [2018-06-24 23:52:53,630 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:53,630 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:53,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:53,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:53,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:53,687 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:53,864 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:52:53,864 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:53,864 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:53,864 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:53,864 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:53,864 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:53,864 INFO ]: Start difference. First operand 31 states and 175 transitions. Second operand 3 states. [2018-06-24 23:52:54,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:54,599 INFO ]: Finished difference Result 55 states and 330 transitions. [2018-06-24 23:52:54,600 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:54,600 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 23:52:54,600 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:54,601 INFO ]: With dead ends: 55 [2018-06-24 23:52:54,601 INFO ]: Without dead ends: 55 [2018-06-24 23:52:54,601 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:54,601 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 23:52:54,606 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-24 23:52:54,606 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-24 23:52:54,607 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 330 transitions. [2018-06-24 23:52:54,608 INFO ]: Start accepts. Automaton has 55 states and 330 transitions. Word has length 10 [2018-06-24 23:52:54,608 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:54,608 INFO ]: Abstraction has 55 states and 330 transitions. [2018-06-24 23:52:54,608 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:54,608 INFO ]: Start isEmpty. Operand 55 states and 330 transitions. [2018-06-24 23:52:54,609 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 23:52:54,609 INFO ]: Found error trace [2018-06-24 23:52:54,609 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:52:54,609 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:54,609 INFO ]: Analyzing trace with hash -906163535, now seen corresponding path program 1 times [2018-06-24 23:52:54,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:54,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:54,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:54,610 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:54,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:54,634 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:54,708 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 23:52:54,708 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:54,708 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:54,708 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:54,708 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:54,708 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:54,709 INFO ]: Start difference. First operand 55 states and 330 transitions. Second operand 3 states. [2018-06-24 23:52:55,561 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:55,561 INFO ]: Finished difference Result 55 states and 240 transitions. [2018-06-24 23:52:55,562 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:55,562 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 23:52:55,562 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:55,563 INFO ]: With dead ends: 55 [2018-06-24 23:52:55,563 INFO ]: Without dead ends: 55 [2018-06-24 23:52:55,564 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:52:55,564 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 23:52:55,568 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-06-24 23:52:55,568 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-24 23:52:55,569 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 234 transitions. [2018-06-24 23:52:55,569 INFO ]: Start accepts. Automaton has 54 states and 234 transitions. Word has length 10 [2018-06-24 23:52:55,569 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:55,569 INFO ]: Abstraction has 54 states and 234 transitions. [2018-06-24 23:52:55,569 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:55,570 INFO ]: Start isEmpty. Operand 54 states and 234 transitions. [2018-06-24 23:52:55,570 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 23:52:55,570 INFO ]: Found error trace [2018-06-24 23:52:55,570 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:52:55,570 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:55,570 INFO ]: Analyzing trace with hash -771230905, now seen corresponding path program 1 times [2018-06-24 23:52:55,571 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:55,571 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:55,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:55,571 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:55,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:55,644 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:55,756 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:52:55,756 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:55,756 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:55,756 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:55,757 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:55,757 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:55,757 INFO ]: Start difference. First operand 54 states and 234 transitions. Second operand 3 states. [2018-06-24 23:52:57,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:57,003 INFO ]: Finished difference Result 101 states and 399 transitions. [2018-06-24 23:52:57,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:57,003 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 23:52:57,003 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:57,005 INFO ]: With dead ends: 101 [2018-06-24 23:52:57,005 INFO ]: Without dead ends: 101 [2018-06-24 23:52:57,005 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:52:57,005 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-24 23:52:57,017 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-06-24 23:52:57,017 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-24 23:52:57,019 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 397 transitions. [2018-06-24 23:52:57,019 INFO ]: Start accepts. Automaton has 100 states and 397 transitions. Word has length 11 [2018-06-24 23:52:57,019 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:57,019 INFO ]: Abstraction has 100 states and 397 transitions. [2018-06-24 23:52:57,019 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:57,019 INFO ]: Start isEmpty. Operand 100 states and 397 transitions. [2018-06-24 23:52:57,020 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 23:52:57,020 INFO ]: Found error trace [2018-06-24 23:52:57,020 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:52:57,020 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:57,020 INFO ]: Analyzing trace with hash 1165673873, now seen corresponding path program 1 times [2018-06-24 23:52:57,020 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:57,020 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:57,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:57,021 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:57,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:57,066 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:57,212 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 23:52:57,212 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:57,212 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:57,212 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:57,213 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:57,213 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:57,213 INFO ]: Start difference. First operand 100 states and 397 transitions. Second operand 3 states. [2018-06-24 23:52:57,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:57,779 INFO ]: Finished difference Result 184 states and 718 transitions. [2018-06-24 23:52:57,781 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:57,781 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 23:52:57,781 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:57,783 INFO ]: With dead ends: 184 [2018-06-24 23:52:57,783 INFO ]: Without dead ends: 184 [2018-06-24 23:52:57,784 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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:52:57,784 INFO ]: Start minimizeSevpa. Operand 184 states. [2018-06-24 23:52:57,798 INFO ]: Finished minimizeSevpa. Reduced states from 184 to 175. [2018-06-24 23:52:57,798 INFO ]: Start removeUnreachable. Operand 175 states. [2018-06-24 23:52:57,800 INFO ]: Finished removeUnreachable. Reduced from 175 states to 175 states and 696 transitions. [2018-06-24 23:52:57,801 INFO ]: Start accepts. Automaton has 175 states and 696 transitions. Word has length 12 [2018-06-24 23:52:57,801 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:57,801 INFO ]: Abstraction has 175 states and 696 transitions. [2018-06-24 23:52:57,801 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:57,801 INFO ]: Start isEmpty. Operand 175 states and 696 transitions. [2018-06-24 23:52:57,803 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 23:52:57,803 INFO ]: Found error trace [2018-06-24 23:52:57,808 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:52:57,808 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:57,808 INFO ]: Analyzing trace with hash 607899206, now seen corresponding path program 1 times [2018-06-24 23:52:57,808 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:57,808 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:57,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:57,809 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:57,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:57,854 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:57,952 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 23:52:57,952 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:57,952 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:57,953 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:57,953 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:57,953 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:57,953 INFO ]: Start difference. First operand 175 states and 696 transitions. Second operand 3 states. [2018-06-24 23:52:58,941 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:58,941 INFO ]: Finished difference Result 330 states and 1298 transitions. [2018-06-24 23:52:58,942 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:58,942 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-24 23:52:58,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:58,945 INFO ]: With dead ends: 330 [2018-06-24 23:52:58,945 INFO ]: Without dead ends: 330 [2018-06-24 23:52:58,945 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:52:58,945 INFO ]: Start minimizeSevpa. Operand 330 states. [2018-06-24 23:52:58,972 INFO ]: Finished minimizeSevpa. Reduced states from 330 to 290. [2018-06-24 23:52:58,972 INFO ]: Start removeUnreachable. Operand 290 states. [2018-06-24 23:52:58,980 INFO ]: Finished removeUnreachable. Reduced from 290 states to 290 states and 1194 transitions. [2018-06-24 23:52:58,980 INFO ]: Start accepts. Automaton has 290 states and 1194 transitions. Word has length 13 [2018-06-24 23:52:58,980 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:58,980 INFO ]: Abstraction has 290 states and 1194 transitions. [2018-06-24 23:52:58,980 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:58,980 INFO ]: Start isEmpty. Operand 290 states and 1194 transitions. [2018-06-24 23:52:58,983 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 23:52:58,983 INFO ]: Found error trace [2018-06-24 23:52:58,983 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:52:58,989 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:58,989 INFO ]: Analyzing trace with hash 2111987420, now seen corresponding path program 1 times [2018-06-24 23:52:58,989 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:58,989 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:58,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:58,989 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:58,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:59,023 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:52:59,114 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 23:52:59,115 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:52:59,115 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:52:59,115 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:52:59,115 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:52:59,115 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:52:59,115 INFO ]: Start difference. First operand 290 states and 1194 transitions. Second operand 3 states. [2018-06-24 23:52:59,902 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:52:59,902 INFO ]: Finished difference Result 180 states and 523 transitions. [2018-06-24 23:52:59,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:52:59,902 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-24 23:52:59,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:52:59,904 INFO ]: With dead ends: 180 [2018-06-24 23:52:59,904 INFO ]: Without dead ends: 173 [2018-06-24 23:52:59,904 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:52:59,904 INFO ]: Start minimizeSevpa. Operand 173 states. [2018-06-24 23:52:59,914 INFO ]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-06-24 23:52:59,914 INFO ]: Start removeUnreachable. Operand 173 states. [2018-06-24 23:52:59,916 INFO ]: Finished removeUnreachable. Reduced from 173 states to 173 states and 514 transitions. [2018-06-24 23:52:59,916 INFO ]: Start accepts. Automaton has 173 states and 514 transitions. Word has length 13 [2018-06-24 23:52:59,916 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:52:59,916 INFO ]: Abstraction has 173 states and 514 transitions. [2018-06-24 23:52:59,916 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:52:59,916 INFO ]: Start isEmpty. Operand 173 states and 514 transitions. [2018-06-24 23:52:59,917 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 23:52:59,917 INFO ]: Found error trace [2018-06-24 23:52:59,917 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:52:59,917 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:52:59,918 INFO ]: Analyzing trace with hash -1545527790, now seen corresponding path program 1 times [2018-06-24 23:52:59,918 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:52:59,918 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:52:59,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:59,918 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:52:59,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:52:59,961 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:00,087 INFO ]: Checked inductivity of 45 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 23:53:00,087 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:00,087 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:00,087 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:00,087 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:00,087 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:00,087 INFO ]: Start difference. First operand 173 states and 514 transitions. Second operand 3 states. [2018-06-24 23:53:00,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:00,644 INFO ]: Finished difference Result 176 states and 523 transitions. [2018-06-24 23:53:00,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:00,645 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-24 23:53:00,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:00,646 INFO ]: With dead ends: 176 [2018-06-24 23:53:00,646 INFO ]: Without dead ends: 176 [2018-06-24 23:53:00,646 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:00,646 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-24 23:53:00,655 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-06-24 23:53:00,656 INFO ]: Start removeUnreachable. Operand 174 states. [2018-06-24 23:53:00,657 INFO ]: Finished removeUnreachable. Reduced from 174 states to 174 states and 515 transitions. [2018-06-24 23:53:00,657 INFO ]: Start accepts. Automaton has 174 states and 515 transitions. Word has length 14 [2018-06-24 23:53:00,657 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:00,657 INFO ]: Abstraction has 174 states and 515 transitions. [2018-06-24 23:53:00,657 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:00,657 INFO ]: Start isEmpty. Operand 174 states and 515 transitions. [2018-06-24 23:53:00,659 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:53:00,659 INFO ]: Found error trace [2018-06-24 23:53:00,659 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:00,659 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:00,659 INFO ]: Analyzing trace with hash -1425098839, now seen corresponding path program 1 times [2018-06-24 23:53:00,659 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:00,659 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:00,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:00,660 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:00,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:00,705 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:00,962 WARN ]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-24 23:53:01,107 INFO ]: Checked inductivity of 78 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 23:53:01,107 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:01,107 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:01,107 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:01,107 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:01,107 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:01,107 INFO ]: Start difference. First operand 174 states and 515 transitions. Second operand 3 states. [2018-06-24 23:53:02,014 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:02,014 INFO ]: Finished difference Result 300 states and 869 transitions. [2018-06-24 23:53:02,014 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:02,014 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 23:53:02,015 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:02,017 INFO ]: With dead ends: 300 [2018-06-24 23:53:02,017 INFO ]: Without dead ends: 300 [2018-06-24 23:53:02,017 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:02,017 INFO ]: Start minimizeSevpa. Operand 300 states. [2018-06-24 23:53:02,030 INFO ]: Finished minimizeSevpa. Reduced states from 300 to 299. [2018-06-24 23:53:02,030 INFO ]: Start removeUnreachable. Operand 299 states. [2018-06-24 23:53:02,032 INFO ]: Finished removeUnreachable. Reduced from 299 states to 299 states and 867 transitions. [2018-06-24 23:53:02,032 INFO ]: Start accepts. Automaton has 299 states and 867 transitions. Word has length 17 [2018-06-24 23:53:02,032 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:02,032 INFO ]: Abstraction has 299 states and 867 transitions. [2018-06-24 23:53:02,032 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:02,032 INFO ]: Start isEmpty. Operand 299 states and 867 transitions. [2018-06-24 23:53:02,033 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:53:02,033 INFO ]: Found error trace [2018-06-24 23:53:02,033 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:02,034 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:02,034 INFO ]: Analyzing trace with hash 1334944450, now seen corresponding path program 1 times [2018-06-24 23:53:02,034 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:02,034 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:02,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:02,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:02,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:02,077 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:02,182 INFO ]: Checked inductivity of 78 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 23:53:02,182 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:02,183 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:02,183 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:02,183 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:02,183 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:02,183 INFO ]: Start difference. First operand 299 states and 867 transitions. Second operand 3 states. [2018-06-24 23:53:02,659 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:02,659 INFO ]: Finished difference Result 532 states and 1379 transitions. [2018-06-24 23:53:02,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:02,660 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 23:53:02,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:02,663 INFO ]: With dead ends: 532 [2018-06-24 23:53:02,663 INFO ]: Without dead ends: 531 [2018-06-24 23:53:02,663 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:02,663 INFO ]: Start minimizeSevpa. Operand 531 states. [2018-06-24 23:53:02,680 INFO ]: Finished minimizeSevpa. Reduced states from 531 to 531. [2018-06-24 23:53:02,680 INFO ]: Start removeUnreachable. Operand 531 states. [2018-06-24 23:53:02,683 INFO ]: Finished removeUnreachable. Reduced from 531 states to 531 states and 1378 transitions. [2018-06-24 23:53:02,683 INFO ]: Start accepts. Automaton has 531 states and 1378 transitions. Word has length 17 [2018-06-24 23:53:02,683 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:02,683 INFO ]: Abstraction has 531 states and 1378 transitions. [2018-06-24 23:53:02,683 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:02,683 INFO ]: Start isEmpty. Operand 531 states and 1378 transitions. [2018-06-24 23:53:02,685 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 23:53:02,685 INFO ]: Found error trace [2018-06-24 23:53:02,685 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:02,685 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:02,685 INFO ]: Analyzing trace with hash -890817994, now seen corresponding path program 1 times [2018-06-24 23:53:02,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:02,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:02,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:02,688 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:02,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:02,729 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:02,836 INFO ]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-24 23:53:02,837 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:02,837 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:02,837 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:02,837 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:02,837 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:02,837 INFO ]: Start difference. First operand 531 states and 1378 transitions. Second operand 3 states. [2018-06-24 23:53:03,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:03,358 INFO ]: Finished difference Result 675 states and 1729 transitions. [2018-06-24 23:53:03,358 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:03,358 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 23:53:03,359 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:03,362 INFO ]: With dead ends: 675 [2018-06-24 23:53:03,362 INFO ]: Without dead ends: 675 [2018-06-24 23:53:03,363 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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:03,363 INFO ]: Start minimizeSevpa. Operand 675 states. [2018-06-24 23:53:03,383 INFO ]: Finished minimizeSevpa. Reduced states from 675 to 557. [2018-06-24 23:53:03,383 INFO ]: Start removeUnreachable. Operand 557 states. [2018-06-24 23:53:03,386 INFO ]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1461 transitions. [2018-06-24 23:53:03,386 INFO ]: Start accepts. Automaton has 557 states and 1461 transitions. Word has length 17 [2018-06-24 23:53:03,386 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:03,386 INFO ]: Abstraction has 557 states and 1461 transitions. [2018-06-24 23:53:03,386 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:03,386 INFO ]: Start isEmpty. Operand 557 states and 1461 transitions. [2018-06-24 23:53:03,388 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 23:53:03,388 INFO ]: Found error trace [2018-06-24 23:53:03,388 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:53:03,388 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:03,388 INFO ]: Analyzing trace with hash 313932299, now seen corresponding path program 1 times [2018-06-24 23:53:03,388 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:03,388 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:03,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:03,389 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:03,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:03,431 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:03,612 INFO ]: Checked inductivity of 91 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-24 23:53:03,612 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:03,612 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:03,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:04,235 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:04,260 INFO ]: Computing forward predicates... [2018-06-24 23:53:04,387 INFO ]: Checked inductivity of 91 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-24 23:53:04,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:53:04,423 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 23:53:04,423 INFO ]: Interpolant automaton has 6 states [2018-06-24 23:53:04,423 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 23:53:04,423 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:53:04,424 INFO ]: Start difference. First operand 557 states and 1461 transitions. Second operand 6 states. [2018-06-24 23:53:05,779 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:05,779 INFO ]: Finished difference Result 968 states and 2451 transitions. [2018-06-24 23:53:05,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 23:53:05,779 INFO ]: Start accepts. Automaton has 6 states. Word has length 18 [2018-06-24 23:53:05,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:05,787 INFO ]: With dead ends: 968 [2018-06-24 23:53:05,788 INFO ]: Without dead ends: 968 [2018-06-24 23:53:05,788 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:53:05,788 INFO ]: Start minimizeSevpa. Operand 968 states. [2018-06-24 23:53:05,823 INFO ]: Finished minimizeSevpa. Reduced states from 968 to 959. [2018-06-24 23:53:05,823 INFO ]: Start removeUnreachable. Operand 959 states. [2018-06-24 23:53:05,827 INFO ]: Finished removeUnreachable. Reduced from 959 states to 959 states and 2439 transitions. [2018-06-24 23:53:05,827 INFO ]: Start accepts. Automaton has 959 states and 2439 transitions. Word has length 18 [2018-06-24 23:53:05,827 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:05,827 INFO ]: Abstraction has 959 states and 2439 transitions. [2018-06-24 23:53:05,828 INFO ]: Interpolant automaton has 6 states. [2018-06-24 23:53:05,828 INFO ]: Start isEmpty. Operand 959 states and 2439 transitions. [2018-06-24 23:53:05,831 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 23:53:05,831 INFO ]: Found error trace [2018-06-24 23:53:05,831 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:53:05,831 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:05,831 INFO ]: Analyzing trace with hash 2012596031, now seen corresponding path program 1 times [2018-06-24 23:53:05,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:05,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:05,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:05,832 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:05,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:05,892 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:06,199 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:53:06,199 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:06,199 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:53:06,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:06,837 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:06,861 INFO ]: Computing forward predicates... [2018-06-24 23:53:06,967 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:53:07,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:53:07,001 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 23:53:07,001 INFO ]: Interpolant automaton has 5 states [2018-06-24 23:53:07,002 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 23:53:07,002 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 23:53:07,002 INFO ]: Start difference. First operand 959 states and 2439 transitions. Second operand 5 states. [2018-06-24 23:53:09,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:09,645 INFO ]: Finished difference Result 983 states and 2497 transitions. [2018-06-24 23:53:09,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 23:53:09,645 INFO ]: Start accepts. Automaton has 5 states. Word has length 18 [2018-06-24 23:53:09,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:09,651 INFO ]: With dead ends: 983 [2018-06-24 23:53:09,651 INFO ]: Without dead ends: 983 [2018-06-24 23:53:09,651 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:53:09,652 INFO ]: Start minimizeSevpa. Operand 983 states. [2018-06-24 23:53:09,681 INFO ]: Finished minimizeSevpa. Reduced states from 983 to 969. [2018-06-24 23:53:09,681 INFO ]: Start removeUnreachable. Operand 969 states. [2018-06-24 23:53:09,685 INFO ]: Finished removeUnreachable. Reduced from 969 states to 969 states and 2458 transitions. [2018-06-24 23:53:09,685 INFO ]: Start accepts. Automaton has 969 states and 2458 transitions. Word has length 18 [2018-06-24 23:53:09,685 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:09,685 INFO ]: Abstraction has 969 states and 2458 transitions. [2018-06-24 23:53:09,685 INFO ]: Interpolant automaton has 5 states. [2018-06-24 23:53:09,685 INFO ]: Start isEmpty. Operand 969 states and 2458 transitions. [2018-06-24 23:53:09,688 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 23:53:09,688 INFO ]: Found error trace [2018-06-24 23:53:09,688 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:53:09,688 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:09,688 INFO ]: Analyzing trace with hash 1774499008, now seen corresponding path program 1 times [2018-06-24 23:53:09,688 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:09,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:09,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:09,690 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:09,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:09,734 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:09,833 INFO ]: Checked inductivity of 91 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-24 23:53:09,833 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:09,833 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:09,833 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:09,833 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:09,833 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:09,833 INFO ]: Start difference. First operand 969 states and 2458 transitions. Second operand 3 states. [2018-06-24 23:53:10,394 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:10,394 INFO ]: Finished difference Result 1554 states and 3438 transitions. [2018-06-24 23:53:10,394 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:10,394 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-24 23:53:10,394 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:10,400 INFO ]: With dead ends: 1554 [2018-06-24 23:53:10,400 INFO ]: Without dead ends: 1453 [2018-06-24 23:53:10,400 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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:10,401 INFO ]: Start minimizeSevpa. Operand 1453 states. [2018-06-24 23:53:10,440 INFO ]: Finished minimizeSevpa. Reduced states from 1453 to 1073. [2018-06-24 23:53:10,440 INFO ]: Start removeUnreachable. Operand 1073 states. [2018-06-24 23:53:10,444 INFO ]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 2439 transitions. [2018-06-24 23:53:10,444 INFO ]: Start accepts. Automaton has 1073 states and 2439 transitions. Word has length 18 [2018-06-24 23:53:10,444 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:10,444 INFO ]: Abstraction has 1073 states and 2439 transitions. [2018-06-24 23:53:10,444 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:10,444 INFO ]: Start isEmpty. Operand 1073 states and 2439 transitions. [2018-06-24 23:53:10,448 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 23:53:10,448 INFO ]: Found error trace [2018-06-24 23:53:10,448 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] [2018-06-24 23:53:10,448 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:10,448 INFO ]: Analyzing trace with hash 1295949157, now seen corresponding path program 1 times [2018-06-24 23:53:10,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:10,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:10,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:10,451 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:10,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:10,491 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:10,598 INFO ]: Checked inductivity of 153 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 23:53:10,598 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:10,598 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:10,598 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:10,598 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:10,598 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:10,598 INFO ]: Start difference. First operand 1073 states and 2439 transitions. Second operand 3 states. [2018-06-24 23:53:11,015 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:11,015 INFO ]: Finished difference Result 1483 states and 3212 transitions. [2018-06-24 23:53:11,016 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:11,016 INFO ]: Start accepts. Automaton has 3 states. Word has length 22 [2018-06-24 23:53:11,016 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:11,022 INFO ]: With dead ends: 1483 [2018-06-24 23:53:11,022 INFO ]: Without dead ends: 1451 [2018-06-24 23:53:11,022 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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:11,023 INFO ]: Start minimizeSevpa. Operand 1451 states. [2018-06-24 23:53:11,062 INFO ]: Finished minimizeSevpa. Reduced states from 1451 to 1407. [2018-06-24 23:53:11,062 INFO ]: Start removeUnreachable. Operand 1407 states. [2018-06-24 23:53:11,067 INFO ]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 3103 transitions. [2018-06-24 23:53:11,067 INFO ]: Start accepts. Automaton has 1407 states and 3103 transitions. Word has length 22 [2018-06-24 23:53:11,067 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:11,067 INFO ]: Abstraction has 1407 states and 3103 transitions. [2018-06-24 23:53:11,067 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:11,067 INFO ]: Start isEmpty. Operand 1407 states and 3103 transitions. [2018-06-24 23:53:11,071 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 23:53:11,071 INFO ]: Found error trace [2018-06-24 23:53:11,071 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] [2018-06-24 23:53:11,072 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:11,072 INFO ]: Analyzing trace with hash -2114720270, now seen corresponding path program 1 times [2018-06-24 23:53:11,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:11,072 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:11,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:11,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:11,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:11,118 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:11,285 INFO ]: Checked inductivity of 190 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-24 23:53:11,285 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:11,285 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:11,285 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:11,285 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:11,285 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:11,285 INFO ]: Start difference. First operand 1407 states and 3103 transitions. Second operand 3 states. [2018-06-24 23:53:11,735 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:11,736 INFO ]: Finished difference Result 2063 states and 4363 transitions. [2018-06-24 23:53:11,736 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:11,736 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-24 23:53:11,736 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:11,742 INFO ]: With dead ends: 2063 [2018-06-24 23:53:11,742 INFO ]: Without dead ends: 2063 [2018-06-24 23:53:11,743 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:11,744 INFO ]: Start minimizeSevpa. Operand 2063 states. [2018-06-24 23:53:11,798 INFO ]: Finished minimizeSevpa. Reduced states from 2063 to 2010. [2018-06-24 23:53:11,798 INFO ]: Start removeUnreachable. Operand 2010 states. [2018-06-24 23:53:11,807 INFO ]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4275 transitions. [2018-06-24 23:53:11,807 INFO ]: Start accepts. Automaton has 2010 states and 4275 transitions. Word has length 24 [2018-06-24 23:53:11,807 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:11,807 INFO ]: Abstraction has 2010 states and 4275 transitions. [2018-06-24 23:53:11,807 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:11,807 INFO ]: Start isEmpty. Operand 2010 states and 4275 transitions. [2018-06-24 23:53:11,813 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 23:53:11,813 INFO ]: Found error trace [2018-06-24 23:53:11,813 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] [2018-06-24 23:53:11,814 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:11,814 INFO ]: Analyzing trace with hash 794479380, now seen corresponding path program 1 times [2018-06-24 23:53:11,814 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:11,814 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:11,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:11,814 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:11,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:11,872 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:12,071 INFO ]: Checked inductivity of 190 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-24 23:53:12,072 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:12,072 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:12,072 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:12,072 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:12,072 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:12,072 INFO ]: Start difference. First operand 2010 states and 4275 transitions. Second operand 3 states. [2018-06-24 23:53:12,582 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:12,582 INFO ]: Finished difference Result 2381 states and 4846 transitions. [2018-06-24 23:53:12,583 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:12,583 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-24 23:53:12,583 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:12,589 INFO ]: With dead ends: 2381 [2018-06-24 23:53:12,589 INFO ]: Without dead ends: 2378 [2018-06-24 23:53:12,590 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:12,591 INFO ]: Start minimizeSevpa. Operand 2378 states. [2018-06-24 23:53:12,653 INFO ]: Finished minimizeSevpa. Reduced states from 2378 to 2345. [2018-06-24 23:53:12,653 INFO ]: Start removeUnreachable. Operand 2345 states. [2018-06-24 23:53:12,662 INFO ]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 4787 transitions. [2018-06-24 23:53:12,662 INFO ]: Start accepts. Automaton has 2345 states and 4787 transitions. Word has length 24 [2018-06-24 23:53:12,663 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:12,663 INFO ]: Abstraction has 2345 states and 4787 transitions. [2018-06-24 23:53:12,663 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:12,663 INFO ]: Start isEmpty. Operand 2345 states and 4787 transitions. [2018-06-24 23:53:12,670 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 23:53:12,670 INFO ]: Found error trace [2018-06-24 23:53:12,670 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] [2018-06-24 23:53:12,670 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:12,670 INFO ]: Analyzing trace with hash 1251340263, now seen corresponding path program 1 times [2018-06-24 23:53:12,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:12,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:12,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:12,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:12,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:12,732 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:12,853 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:53:12,853 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:12,853 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:12,853 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:12,853 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:12,853 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:12,853 INFO ]: Start difference. First operand 2345 states and 4787 transitions. Second operand 3 states. [2018-06-24 23:53:13,378 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:13,378 INFO ]: Finished difference Result 2957 states and 5689 transitions. [2018-06-24 23:53:13,378 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:13,378 INFO ]: Start accepts. Automaton has 3 states. Word has length 25 [2018-06-24 23:53:13,379 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:13,387 INFO ]: With dead ends: 2957 [2018-06-24 23:53:13,387 INFO ]: Without dead ends: 2939 [2018-06-24 23:53:13,388 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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:13,390 INFO ]: Start minimizeSevpa. Operand 2939 states. [2018-06-24 23:53:13,447 INFO ]: Finished minimizeSevpa. Reduced states from 2939 to 2841. [2018-06-24 23:53:13,447 INFO ]: Start removeUnreachable. Operand 2841 states. [2018-06-24 23:53:13,458 INFO ]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 5482 transitions. [2018-06-24 23:53:13,458 INFO ]: Start accepts. Automaton has 2841 states and 5482 transitions. Word has length 25 [2018-06-24 23:53:13,458 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:13,458 INFO ]: Abstraction has 2841 states and 5482 transitions. [2018-06-24 23:53:13,458 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:13,458 INFO ]: Start isEmpty. Operand 2841 states and 5482 transitions. [2018-06-24 23:53:13,466 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 23:53:13,466 INFO ]: Found error trace [2018-06-24 23:53:13,466 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:13,466 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:13,466 INFO ]: Analyzing trace with hash -23778862, now seen corresponding path program 1 times [2018-06-24 23:53:13,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:13,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:13,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:13,467 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:13,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:13,557 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:13,890 INFO ]: Checked inductivity of 325 backedges. 221 proven. 12 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-24 23:53:13,890 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:13,890 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) [2018-06-24 23:53:13,905 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:53:15,039 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:15,075 INFO ]: Computing forward predicates... [2018-06-24 23:53:15,138 INFO ]: Checked inductivity of 325 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-06-24 23:53:15,170 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 23:53:15,170 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-24 23:53:15,170 INFO ]: Interpolant automaton has 6 states [2018-06-24 23:53:15,171 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 23:53:15,171 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:53:15,171 INFO ]: Start difference. First operand 2841 states and 5482 transitions. Second operand 6 states. [2018-06-24 23:53:15,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:15,866 INFO ]: Finished difference Result 3580 states and 6469 transitions. [2018-06-24 23:53:15,866 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 23:53:15,866 INFO ]: Start accepts. Automaton has 6 states. Word has length 30 [2018-06-24 23:53:15,866 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:15,875 INFO ]: With dead ends: 3580 [2018-06-24 23:53:15,875 INFO ]: Without dead ends: 3522 [2018-06-24 23:53:15,875 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:53:15,877 INFO ]: Start minimizeSevpa. Operand 3522 states. [2018-06-24 23:53:15,928 INFO ]: Finished minimizeSevpa. Reduced states from 3522 to 2591. [2018-06-24 23:53:15,928 INFO ]: Start removeUnreachable. Operand 2591 states. [2018-06-24 23:53:15,933 INFO ]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 4956 transitions. [2018-06-24 23:53:15,933 INFO ]: Start accepts. Automaton has 2591 states and 4956 transitions. Word has length 30 [2018-06-24 23:53:15,933 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:15,933 INFO ]: Abstraction has 2591 states and 4956 transitions. [2018-06-24 23:53:15,933 INFO ]: Interpolant automaton has 6 states. [2018-06-24 23:53:15,933 INFO ]: Start isEmpty. Operand 2591 states and 4956 transitions. [2018-06-24 23:53:15,941 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 23:53:15,941 INFO ]: Found error trace [2018-06-24 23:53:15,941 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:15,941 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:15,942 INFO ]: Analyzing trace with hash -570704595, now seen corresponding path program 1 times [2018-06-24 23:53:15,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:15,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:15,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:15,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:15,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:16,001 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:16,209 INFO ]: Checked inductivity of 378 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-06-24 23:53:16,209 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:16,209 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:16,209 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:16,209 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:16,209 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:16,209 INFO ]: Start difference. First operand 2591 states and 4956 transitions. Second operand 3 states. [2018-06-24 23:53:16,618 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:16,618 INFO ]: Finished difference Result 3064 states and 5676 transitions. [2018-06-24 23:53:16,618 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:16,618 INFO ]: Start accepts. Automaton has 3 states. Word has length 32 [2018-06-24 23:53:16,618 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:16,624 INFO ]: With dead ends: 3064 [2018-06-24 23:53:16,624 INFO ]: Without dead ends: 2878 [2018-06-24 23:53:16,625 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:53:16,626 INFO ]: Start minimizeSevpa. Operand 2878 states. [2018-06-24 23:53:16,670 INFO ]: Finished minimizeSevpa. Reduced states from 2878 to 2683. [2018-06-24 23:53:16,670 INFO ]: Start removeUnreachable. Operand 2683 states. [2018-06-24 23:53:16,676 INFO ]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4999 transitions. [2018-06-24 23:53:16,676 INFO ]: Start accepts. Automaton has 2683 states and 4999 transitions. Word has length 32 [2018-06-24 23:53:16,676 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:16,676 INFO ]: Abstraction has 2683 states and 4999 transitions. [2018-06-24 23:53:16,676 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:16,676 INFO ]: Start isEmpty. Operand 2683 states and 4999 transitions. [2018-06-24 23:53:16,681 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 23:53:16,681 INFO ]: Found error trace [2018-06-24 23:53:16,681 INFO ]: trace histogram [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:53:16,681 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:16,682 INFO ]: Analyzing trace with hash 1857158569, now seen corresponding path program 1 times [2018-06-24 23:53:16,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:16,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:16,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:16,682 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:16,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:16,758 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:16,904 INFO ]: Checked inductivity of 378 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-06-24 23:53:16,904 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:16,904 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:16,904 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:16,905 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:16,905 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:16,905 INFO ]: Start difference. First operand 2683 states and 4999 transitions. Second operand 3 states. [2018-06-24 23:53:17,349 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:17,349 INFO ]: Finished difference Result 4679 states and 8198 transitions. [2018-06-24 23:53:17,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:17,349 INFO ]: Start accepts. Automaton has 3 states. Word has length 32 [2018-06-24 23:53:17,349 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:17,357 INFO ]: With dead ends: 4679 [2018-06-24 23:53:17,357 INFO ]: Without dead ends: 4393 [2018-06-24 23:53:17,358 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:17,359 INFO ]: Start minimizeSevpa. Operand 4393 states. [2018-06-24 23:53:17,422 INFO ]: Finished minimizeSevpa. Reduced states from 4393 to 3041. [2018-06-24 23:53:17,422 INFO ]: Start removeUnreachable. Operand 3041 states. [2018-06-24 23:53:17,428 INFO ]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 5623 transitions. [2018-06-24 23:53:17,428 INFO ]: Start accepts. Automaton has 3041 states and 5623 transitions. Word has length 32 [2018-06-24 23:53:17,428 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:17,428 INFO ]: Abstraction has 3041 states and 5623 transitions. [2018-06-24 23:53:17,428 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:17,428 INFO ]: Start isEmpty. Operand 3041 states and 5623 transitions. [2018-06-24 23:53:17,434 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 23:53:17,434 INFO ]: Found error trace [2018-06-24 23:53:17,434 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] [2018-06-24 23:53:17,434 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:17,434 INFO ]: Analyzing trace with hash -1491158059, now seen corresponding path program 1 times [2018-06-24 23:53:17,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:17,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:17,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:17,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:17,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:17,516 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:18,082 INFO ]: Checked inductivity of 406 backedges. 156 proven. 163 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-24 23:53:18,082 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:18,141 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:53:18,146 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:19,211 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:19,247 INFO ]: Computing forward predicates... [2018-06-24 23:53:19,290 INFO ]: Checked inductivity of 406 backedges. 146 proven. 156 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-06-24 23:53:19,315 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:53:19,315 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-06-24 23:53:19,316 INFO ]: Interpolant automaton has 10 states [2018-06-24 23:53:19,316 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 23:53:19,316 INFO ]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-24 23:53:19,316 INFO ]: Start difference. First operand 3041 states and 5623 transitions. Second operand 10 states. [2018-06-24 23:53:21,669 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:21,670 INFO ]: Finished difference Result 8005 states and 14267 transitions. [2018-06-24 23:53:21,670 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 23:53:21,670 INFO ]: Start accepts. Automaton has 10 states. Word has length 33 [2018-06-24 23:53:21,670 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:21,680 INFO ]: With dead ends: 8005 [2018-06-24 23:53:21,680 INFO ]: Without dead ends: 4635 [2018-06-24 23:53:21,680 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-06-24 23:53:21,682 INFO ]: Start minimizeSevpa. Operand 4635 states. [2018-06-24 23:53:21,746 INFO ]: Finished minimizeSevpa. Reduced states from 4635 to 3997. [2018-06-24 23:53:21,746 INFO ]: Start removeUnreachable. Operand 3997 states. [2018-06-24 23:53:21,755 INFO ]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 7347 transitions. [2018-06-24 23:53:21,755 INFO ]: Start accepts. Automaton has 3997 states and 7347 transitions. Word has length 33 [2018-06-24 23:53:21,755 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:21,755 INFO ]: Abstraction has 3997 states and 7347 transitions. [2018-06-24 23:53:21,755 INFO ]: Interpolant automaton has 10 states. [2018-06-24 23:53:21,755 INFO ]: Start isEmpty. Operand 3997 states and 7347 transitions. [2018-06-24 23:53:21,764 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 23:53:21,764 INFO ]: Found error trace [2018-06-24 23:53:21,764 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] [2018-06-24 23:53:21,764 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:21,764 INFO ]: Analyzing trace with hash -1675388657, now seen corresponding path program 1 times [2018-06-24 23:53:21,764 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:21,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:21,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:21,765 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:21,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:21,854 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:22,158 INFO ]: Checked inductivity of 406 backedges. 126 proven. 179 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-06-24 23:53:22,158 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:22,158 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:53:22,165 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:23,098 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:23,580 INFO ]: Computing forward predicates... [2018-06-24 23:53:23,620 INFO ]: Checked inductivity of 406 backedges. 227 proven. 72 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-06-24 23:53:23,647 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:53:23,647 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-06-24 23:53:23,647 INFO ]: Interpolant automaton has 9 states [2018-06-24 23:53:23,647 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 23:53:23,647 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-24 23:53:23,647 INFO ]: Start difference. First operand 3997 states and 7347 transitions. Second operand 9 states. [2018-06-24 23:53:25,654 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:25,654 INFO ]: Finished difference Result 8681 states and 15610 transitions. [2018-06-24 23:53:25,654 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 23:53:25,654 INFO ]: Start accepts. Automaton has 9 states. Word has length 33 [2018-06-24 23:53:25,654 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:25,663 INFO ]: With dead ends: 8681 [2018-06-24 23:53:25,663 INFO ]: Without dead ends: 3999 [2018-06-24 23:53:25,663 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2018-06-24 23:53:25,666 INFO ]: Start minimizeSevpa. Operand 3999 states. [2018-06-24 23:53:25,716 INFO ]: Finished minimizeSevpa. Reduced states from 3999 to 3929. [2018-06-24 23:53:25,716 INFO ]: Start removeUnreachable. Operand 3929 states. [2018-06-24 23:53:25,722 INFO ]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 7105 transitions. [2018-06-24 23:53:25,723 INFO ]: Start accepts. Automaton has 3929 states and 7105 transitions. Word has length 33 [2018-06-24 23:53:25,723 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:25,723 INFO ]: Abstraction has 3929 states and 7105 transitions. [2018-06-24 23:53:25,723 INFO ]: Interpolant automaton has 9 states. [2018-06-24 23:53:25,723 INFO ]: Start isEmpty. Operand 3929 states and 7105 transitions. [2018-06-24 23:53:25,730 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 23:53:25,730 INFO ]: Found error trace [2018-06-24 23:53:25,730 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:25,731 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:25,731 INFO ]: Analyzing trace with hash -1566421907, now seen corresponding path program 1 times [2018-06-24 23:53:25,731 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:25,731 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:25,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:25,732 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:25,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:25,782 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:25,869 INFO ]: Checked inductivity of 465 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2018-06-24 23:53:25,869 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:25,869 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:25,870 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:25,870 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:25,870 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:25,870 INFO ]: Start difference. First operand 3929 states and 7105 transitions. Second operand 3 states. [2018-06-24 23:53:26,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:26,261 INFO ]: Finished difference Result 4635 states and 7925 transitions. [2018-06-24 23:53:26,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:26,261 INFO ]: Start accepts. Automaton has 3 states. Word has length 35 [2018-06-24 23:53:26,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:26,264 INFO ]: With dead ends: 4635 [2018-06-24 23:53:26,264 INFO ]: Without dead ends: 1877 [2018-06-24 23:53:26,264 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 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:26,265 INFO ]: Start minimizeSevpa. Operand 1877 states. [2018-06-24 23:53:26,279 INFO ]: Finished minimizeSevpa. Reduced states from 1877 to 1065. [2018-06-24 23:53:26,279 INFO ]: Start removeUnreachable. Operand 1065 states. [2018-06-24 23:53:26,280 INFO ]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1663 transitions. [2018-06-24 23:53:26,280 INFO ]: Start accepts. Automaton has 1065 states and 1663 transitions. Word has length 35 [2018-06-24 23:53:26,280 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:26,280 INFO ]: Abstraction has 1065 states and 1663 transitions. [2018-06-24 23:53:26,280 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:26,280 INFO ]: Start isEmpty. Operand 1065 states and 1663 transitions. [2018-06-24 23:53:26,282 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 23:53:26,282 INFO ]: Found error trace [2018-06-24 23:53:26,282 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:26,282 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:26,283 INFO ]: Analyzing trace with hash 1745093446, now seen corresponding path program 1 times [2018-06-24 23:53:26,283 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:26,283 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:26,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:26,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:26,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:26,336 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:26,476 INFO ]: Checked inductivity of 465 backedges. 226 proven. 17 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-06-24 23:53:26,476 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:26,476 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 23:53:26,482 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:27,461 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:27,491 INFO ]: Computing forward predicates... [2018-06-24 23:53:27,544 INFO ]: Checked inductivity of 465 backedges. 226 proven. 17 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-06-24 23:53:27,569 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:53:27,569 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 23:53:27,570 INFO ]: Interpolant automaton has 5 states [2018-06-24 23:53:27,570 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 23:53:27,570 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 23:53:27,570 INFO ]: Start difference. First operand 1065 states and 1663 transitions. Second operand 5 states. [2018-06-24 23:53:28,027 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:28,027 INFO ]: Finished difference Result 1106 states and 1712 transitions. [2018-06-24 23:53:28,028 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 23:53:28,028 INFO ]: Start accepts. Automaton has 5 states. Word has length 35 [2018-06-24 23:53:28,028 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:28,029 INFO ]: With dead ends: 1106 [2018-06-24 23:53:28,029 INFO ]: Without dead ends: 995 [2018-06-24 23:53:28,029 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 3 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:53:28,030 INFO ]: Start minimizeSevpa. Operand 995 states. [2018-06-24 23:53:28,037 INFO ]: Finished minimizeSevpa. Reduced states from 995 to 966. [2018-06-24 23:53:28,037 INFO ]: Start removeUnreachable. Operand 966 states. [2018-06-24 23:53:28,038 INFO ]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1506 transitions. [2018-06-24 23:53:28,039 INFO ]: Start accepts. Automaton has 966 states and 1506 transitions. Word has length 35 [2018-06-24 23:53:28,039 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:28,039 INFO ]: Abstraction has 966 states and 1506 transitions. [2018-06-24 23:53:28,039 INFO ]: Interpolant automaton has 5 states. [2018-06-24 23:53:28,039 INFO ]: Start isEmpty. Operand 966 states and 1506 transitions. [2018-06-24 23:53:28,041 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 23:53:28,041 INFO ]: Found error trace [2018-06-24 23:53:28,041 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:28,041 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:28,041 INFO ]: Analyzing trace with hash 1475546981, now seen corresponding path program 1 times [2018-06-24 23:53:28,041 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:28,041 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:28,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:28,041 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:28,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:28,098 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:28,193 INFO ]: Checked inductivity of 666 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2018-06-24 23:53:28,193 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:28,193 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:28,193 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:28,193 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:28,193 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:28,193 INFO ]: Start difference. First operand 966 states and 1506 transitions. Second operand 3 states. [2018-06-24 23:53:28,496 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:28,496 INFO ]: Finished difference Result 982 states and 1502 transitions. [2018-06-24 23:53:28,496 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:28,496 INFO ]: Start accepts. Automaton has 3 states. Word has length 41 [2018-06-24 23:53:28,496 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:28,497 INFO ]: With dead ends: 982 [2018-06-24 23:53:28,497 INFO ]: Without dead ends: 978 [2018-06-24 23:53:28,498 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 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:28,498 INFO ]: Start minimizeSevpa. Operand 978 states. [2018-06-24 23:53:28,505 INFO ]: Finished minimizeSevpa. Reduced states from 978 to 802. [2018-06-24 23:53:28,505 INFO ]: Start removeUnreachable. Operand 802 states. [2018-06-24 23:53:28,506 INFO ]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1255 transitions. [2018-06-24 23:53:28,506 INFO ]: Start accepts. Automaton has 802 states and 1255 transitions. Word has length 41 [2018-06-24 23:53:28,506 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:28,506 INFO ]: Abstraction has 802 states and 1255 transitions. [2018-06-24 23:53:28,506 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:28,506 INFO ]: Start isEmpty. Operand 802 states and 1255 transitions. [2018-06-24 23:53:28,507 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 23:53:28,507 INFO ]: Found error trace [2018-06-24 23:53:28,507 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:28,507 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:28,508 INFO ]: Analyzing trace with hash 502274504, now seen corresponding path program 1 times [2018-06-24 23:53:28,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:28,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:28,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:28,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:28,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:28,596 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:28,833 INFO ]: Checked inductivity of 666 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-06-24 23:53:28,833 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:28,833 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:28,833 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:28,833 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:28,833 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:28,833 INFO ]: Start difference. First operand 802 states and 1255 transitions. Second operand 3 states. [2018-06-24 23:53:29,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:29,131 INFO ]: Finished difference Result 910 states and 1309 transitions. [2018-06-24 23:53:29,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:29,131 INFO ]: Start accepts. Automaton has 3 states. Word has length 41 [2018-06-24 23:53:29,131 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:29,131 INFO ]: With dead ends: 910 [2018-06-24 23:53:29,131 INFO ]: Without dead ends: 96 [2018-06-24 23:53:29,131 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:53:29,132 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-24 23:53:29,132 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 76. [2018-06-24 23:53:29,132 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-24 23:53:29,132 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2018-06-24 23:53:29,132 INFO ]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 41 [2018-06-24 23:53:29,132 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:29,132 INFO ]: Abstraction has 76 states and 98 transitions. [2018-06-24 23:53:29,132 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:29,132 INFO ]: Start isEmpty. Operand 76 states and 98 transitions. [2018-06-24 23:53:29,132 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-24 23:53:29,132 INFO ]: Found error trace [2018-06-24 23:53:29,132 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:29,132 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:29,133 INFO ]: Analyzing trace with hash -1316296492, now seen corresponding path program 1 times [2018-06-24 23:53:29,133 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:29,133 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:29,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:29,133 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:29,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:29,225 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:29,402 INFO ]: Checked inductivity of 741 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-06-24 23:53:29,403 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:53:29,403 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:53:29,403 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:53:29,403 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:53:29,403 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:53:29,403 INFO ]: Start difference. First operand 76 states and 98 transitions. Second operand 3 states. [2018-06-24 23:53:29,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:29,749 INFO ]: Finished difference Result 98 states and 125 transitions. [2018-06-24 23:53:29,749 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:53:29,749 INFO ]: Start accepts. Automaton has 3 states. Word has length 43 [2018-06-24 23:53:29,749 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:29,749 INFO ]: With dead ends: 98 [2018-06-24 23:53:29,749 INFO ]: Without dead ends: 82 [2018-06-24 23:53:29,749 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 10 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:29,749 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-24 23:53:29,750 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-06-24 23:53:29,750 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-24 23:53:29,750 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2018-06-24 23:53:29,750 INFO ]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 43 [2018-06-24 23:53:29,750 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:29,750 INFO ]: Abstraction has 76 states and 96 transitions. [2018-06-24 23:53:29,750 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:53:29,750 INFO ]: Start isEmpty. Operand 76 states and 96 transitions. [2018-06-24 23:53:29,750 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-24 23:53:29,750 INFO ]: Found error trace [2018-06-24 23:53:29,751 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:29,751 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:29,751 INFO ]: Analyzing trace with hash -1690946888, now seen corresponding path program 1 times [2018-06-24 23:53:29,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:29,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:29,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:29,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:29,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:29,849 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:30,363 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-24 23:53:30,852 INFO ]: Checked inductivity of 741 backedges. 266 proven. 365 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-24 23:53:30,852 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:30,852 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:53:30,858 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:32,151 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:32,200 INFO ]: Computing forward predicates... [2018-06-24 23:53:32,647 INFO ]: Checked inductivity of 741 backedges. 176 proven. 458 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-06-24 23:53:32,674 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:53:32,674 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2018-06-24 23:53:32,674 INFO ]: Interpolant automaton has 18 states [2018-06-24 23:53:32,674 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 23:53:32,674 INFO ]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-06-24 23:53:32,674 INFO ]: Start difference. First operand 76 states and 96 transitions. Second operand 18 states. [2018-06-24 23:53:33,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:33,376 INFO ]: Finished difference Result 118 states and 146 transitions. [2018-06-24 23:53:33,376 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 23:53:33,376 INFO ]: Start accepts. Automaton has 18 states. Word has length 43 [2018-06-24 23:53:33,376 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:33,376 INFO ]: With dead ends: 118 [2018-06-24 23:53:33,376 INFO ]: Without dead ends: 76 [2018-06-24 23:53:33,377 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-06-24 23:53:33,377 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-24 23:53:33,377 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-06-24 23:53:33,377 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-24 23:53:33,378 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2018-06-24 23:53:33,378 INFO ]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 43 [2018-06-24 23:53:33,378 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:33,378 INFO ]: Abstraction has 76 states and 95 transitions. [2018-06-24 23:53:33,378 INFO ]: Interpolant automaton has 18 states. [2018-06-24 23:53:33,378 INFO ]: Start isEmpty. Operand 76 states and 95 transitions. [2018-06-24 23:53:33,378 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-24 23:53:33,378 INFO ]: Found error trace [2018-06-24 23:53:33,378 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:53:33,378 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:53:33,378 INFO ]: Analyzing trace with hash -1416187274, now seen corresponding path program 1 times [2018-06-24 23:53:33,378 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:53:33,378 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:53:33,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:33,379 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:53:33,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:53:33,449 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:33,772 INFO ]: Checked inductivity of 741 backedges. 409 proven. 66 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-06-24 23:53:33,772 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:53:33,821 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:53:33,831 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:53:35,120 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:53:35,174 INFO ]: Computing forward predicates... [2018-06-24 23:53:35,444 INFO ]: Checked inductivity of 741 backedges. 444 proven. 10 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2018-06-24 23:53:35,485 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:53:35,485 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-06-24 23:53:35,485 INFO ]: Interpolant automaton has 7 states [2018-06-24 23:53:35,485 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 23:53:35,485 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 23:53:35,486 INFO ]: Start difference. First operand 76 states and 95 transitions. Second operand 7 states. [2018-06-24 23:53:36,431 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:53:36,431 INFO ]: Finished difference Result 34 states and 41 transitions. [2018-06-24 23:53:36,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 23:53:36,432 INFO ]: Start accepts. Automaton has 7 states. Word has length 43 [2018-06-24 23:53:36,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:53:36,432 INFO ]: With dead ends: 34 [2018-06-24 23:53:36,432 INFO ]: Without dead ends: 0 [2018-06-24 23:53:36,432 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 23:53:36,432 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 23:53:36,432 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 23:53:36,432 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 23:53:36,432 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 23:53:36,432 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-06-24 23:53:36,432 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:53:36,432 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 23:53:36,432 INFO ]: Interpolant automaton has 7 states. [2018-06-24 23:53:36,432 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 23:53:36,432 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 23:53:36,434 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 23:53:36,436 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 11:53:36 BasicIcfg [2018-06-24 23:53:36,436 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 23:53:36,437 INFO ]: Toolchain (without parser) took 54258.94 ms. Allocated memory was 306.2 MB in the beginning and 1.1 GB in the end (delta: 833.1 MB). Free memory was 192.8 MB in the beginning and 497.8 MB in the end (delta: -305.1 MB). Peak memory consumption was 528.0 MB. Max. memory is 3.6 GB. [2018-06-24 23:53:36,437 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 23:53:36,437 INFO ]: ChcToBoogie took 88.81 ms. Allocated memory is still 306.2 MB. Free memory was 192.8 MB in the beginning and 188.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 23:53:36,446 INFO ]: Boogie Preprocessor took 103.74 ms. Allocated memory was 306.2 MB in the beginning and 320.9 MB in the end (delta: 14.7 MB). Free memory was 188.8 MB in the beginning and 291.0 MB in the end (delta: -102.2 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-24 23:53:36,446 INFO ]: RCFGBuilder took 622.51 ms. Allocated memory is still 320.9 MB. Free memory was 291.0 MB in the beginning and 219.8 MB in the end (delta: 71.2 MB). Peak memory consumption was 71.2 MB. Max. memory is 3.6 GB. [2018-06-24 23:53:36,446 INFO ]: BlockEncodingV2 took 3697.79 ms. Allocated memory was 320.9 MB in the beginning and 356.0 MB in the end (delta: 35.1 MB). Free memory was 219.8 MB in the beginning and 255.0 MB in the end (delta: -35.3 MB). Peak memory consumption was 55.7 MB. Max. memory is 3.6 GB. [2018-06-24 23:53:36,447 INFO ]: TraceAbstraction took 49735.99 ms. Allocated memory was 356.0 MB in the beginning and 1.1 GB in the end (delta: 783.3 MB). Free memory was 255.0 MB in the beginning and 497.8 MB in the end (delta: -242.8 MB). Peak memory consumption was 540.5 MB. Max. memory is 3.6 GB. [2018-06-24 23:53:36,449 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, 93 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 88.81 ms. Allocated memory is still 306.2 MB. Free memory was 192.8 MB in the beginning and 188.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 103.74 ms. Allocated memory was 306.2 MB in the beginning and 320.9 MB in the end (delta: 14.7 MB). Free memory was 188.8 MB in the beginning and 291.0 MB in the end (delta: -102.2 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 622.51 ms. Allocated memory is still 320.9 MB. Free memory was 291.0 MB in the beginning and 219.8 MB in the end (delta: 71.2 MB). Peak memory consumption was 71.2 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 3697.79 ms. Allocated memory was 320.9 MB in the beginning and 356.0 MB in the end (delta: 35.1 MB). Free memory was 219.8 MB in the beginning and 255.0 MB in the end (delta: -35.3 MB). Peak memory consumption was 55.7 MB. Max. memory is 3.6 GB. * TraceAbstraction took 49735.99 ms. Allocated memory was 356.0 MB in the beginning and 1.1 GB in the end (delta: 783.3 MB). Free memory was 255.0 MB in the beginning and 497.8 MB in the end (delta: -242.8 MB). Peak memory consumption was 540.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 49.6s OverallTime, 37 OverallIterations, 3 TraceHistogramMax, 29.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 177 SDtfs, 5 SDslu, 241 SDs, 0 SdLazy, 10738 SolverSat, 3008 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 453 SyntacticMatches, 17 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3997occurred in iteration=29, 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.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 5032 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 3.4s SsaConstructionTime, 6.4s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 989 ConstructedInterpolants, 0 QuantifiedInterpolants, 70090 SizeOfPredicates, 0 NumberOfNonLiveVariables, 58834 ConjunctsInSsa, 439 ConjunctsInUnsatCore, 45 InterpolantComputations, 30 PerfectInterpolantSequences, 9543/11122 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_23-53-36-466.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_23-53-36-466.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_23-53-36-466.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mem_slave_tlm.1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_23-53-36-466.csv Received shutdown request...