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-62c3406-m [2018-06-26 20:32:24,099 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:32:24,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:32:24,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:32:24,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:32:24,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:32:24,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:32:24,123 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:32:24,124 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:32:24,126 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:32:24,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:32:24,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:32:24,128 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:32:24,128 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:32:24,133 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:32:24,134 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:32:24,134 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:32:24,147 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:32:24,148 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:32:24,150 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:32:24,151 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:32:24,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:32:24,154 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:32:24,157 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:32:24,157 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:32:24,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:32:24,158 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:32:24,159 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:32:24,160 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:32:24,163 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:32:24,163 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:32:24,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:32:24,163 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:32:24,164 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:32:24,164 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:32:24,167 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:32:24,167 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 20:32:24,192 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:32:24,193 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:32:24,196 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:32:24,196 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:32:24,197 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:32:24,197 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:32:24,198 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:32:24,198 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:32:24,198 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:32:24,198 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:32:24,198 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:32:24,199 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:32:24,201 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:32:24,202 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:32:24,202 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:32:24,202 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:32:24,202 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:32:24,202 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:32:24,202 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:32:24,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:32:24,203 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:32:24,204 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:32:24,204 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:32:24,250 INFO ]: Repository-Root is: /tmp [2018-06-26 20:32:24,268 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:32:24,272 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:32:24,273 INFO ]: Initializing SmtParser... [2018-06-26 20:32:24,273 INFO ]: SmtParser initialized [2018-06-26 20:32:24,274 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.1.smt2 [2018-06-26 20:32:24,275 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 20:32:24,359 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.1.smt2 unknown [2018-06-26 20:32:25,187 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/mem_slave_tlm.1.smt2 [2018-06-26 20:32:25,195 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:32:25,208 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:32:25,209 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:32:25,209 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:32:25,209 INFO ]: ChcToBoogie initialized [2018-06-26 20:32:25,212 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:32:25" (1/1) ... [2018-06-26 20:32:25,299 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:32:25 Unit [2018-06-26 20:32:25,299 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:32:25,300 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:32:25,300 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:32:25,300 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:32:25,317 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:32:25" (1/1) ... [2018-06-26 20:32:25,317 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:32:25" (1/1) ... [2018-06-26 20:32:25,351 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:32:25" (1/1) ... [2018-06-26 20:32:25,351 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:32:25" (1/1) ... [2018-06-26 20:32:25,374 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:32:25" (1/1) ... [2018-06-26 20:32:25,376 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:32:25" (1/1) ... [2018-06-26 20:32:25,383 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:32:25" (1/1) ... [2018-06-26 20:32:25,391 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:32:25,392 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:32:25,392 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:32:25,392 INFO ]: RCFGBuilder initialized [2018-06-26 20:32:25,393 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:32:25" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:32:25,415 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:32:25,415 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:32:25,415 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:32:25,415 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:32:25,415 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:32:25,415 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 20:32:26,114 INFO ]: Using library mode [2018-06-26 20:32:26,115 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:32:26 BoogieIcfgContainer [2018-06-26 20:32:26,115 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:32:26,115 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:32:26,115 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:32:26,116 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:32:26,117 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:32:26" (1/1) ... [2018-06-26 20:32:26,138 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:32:26,139 INFO ]: Using Remove infeasible edges [2018-06-26 20:32:26,140 INFO ]: Using Maximize final states [2018-06-26 20:32:26,141 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:32:26,141 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:32:26,145 INFO ]: Using Remove sink states [2018-06-26 20:32:26,145 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:32:26,145 INFO ]: Using Use SBE [2018-06-26 20:32:26,180 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 20:32:26,592 INFO ]: SBE split 1 edges [2018-06-26 20:32:26,601 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:32:26,602 INFO ]: 0 new accepting states [2018-06-26 20:32:26,651 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:32:26,653 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:32:26,662 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:32:26,662 INFO ]: 0 new accepting states [2018-06-26 20:32:26,662 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:32:26,662 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:32:26,668 INFO ]: Encoded RCFG 6 locations, 93 edges [2018-06-26 20:32:26,668 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:32:26 BasicIcfg [2018-06-26 20:32:26,668 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:32:26,670 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:32:26,670 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:32:26,675 INFO ]: TraceAbstraction initialized [2018-06-26 20:32:26,675 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:32:25" (1/4) ... [2018-06-26 20:32:26,676 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7c1cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:32:26, skipping insertion in model container [2018-06-26 20:32:26,676 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:32:25" (2/4) ... [2018-06-26 20:32:26,676 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7c1cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:32:26, skipping insertion in model container [2018-06-26 20:32:26,676 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:32:26" (3/4) ... [2018-06-26 20:32:26,676 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7c1cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:32:26, skipping insertion in model container [2018-06-26 20:32:26,677 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:32:26" (4/4) ... [2018-06-26 20:32:26,679 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:32:26,688 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:32:26,698 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:32:26,749 INFO ]: Using default assertion order modulation [2018-06-26 20:32:26,750 INFO ]: Interprodecural is true [2018-06-26 20:32:26,750 INFO ]: Hoare is false [2018-06-26 20:32:26,750 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:32:26,750 INFO ]: Backedges is TWOTRACK [2018-06-26 20:32:26,750 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:32:26,750 INFO ]: Difference is false [2018-06-26 20:32:26,750 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:32:26,750 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:32:26,764 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:32:26,779 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:32:26,779 INFO ]: Found error trace [2018-06-26 20:32:26,782 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:32:26,782 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:26,787 INFO ]: Analyzing trace with hash 38108738, now seen corresponding path program 1 times [2018-06-26 20:32:26,789 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:26,789 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:26,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:26,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:26,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:26,916 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:27,066 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:32:27,069 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:27,070 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:27,071 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:27,086 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:27,087 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:27,089 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:32:28,888 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:28,888 INFO ]: Finished difference Result 7 states and 132 transitions. [2018-06-26 20:32:28,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:28,892 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:32:28,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:28,901 INFO ]: With dead ends: 7 [2018-06-26 20:32:28,901 INFO ]: Without dead ends: 7 [2018-06-26 20:32:28,903 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:28,919 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:32:28,939 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:32:28,941 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:32:28,942 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2018-06-26 20:32:28,943 INFO ]: Start accepts. Automaton has 7 states and 132 transitions. Word has length 5 [2018-06-26 20:32:28,944 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:28,944 INFO ]: Abstraction has 7 states and 132 transitions. [2018-06-26 20:32:28,944 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:28,945 INFO ]: Start isEmpty. Operand 7 states and 132 transitions. [2018-06-26 20:32:28,945 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:32:28,945 INFO ]: Found error trace [2018-06-26 20:32:28,945 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:32:28,945 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:28,945 INFO ]: Analyzing trace with hash 1178806128, now seen corresponding path program 1 times [2018-06-26 20:32:28,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:28,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:28,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:28,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:28,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:28,998 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:29,053 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:32:29,053 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:29,053 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:29,055 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:29,055 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:29,055 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:29,055 INFO ]: Start difference. First operand 7 states and 132 transitions. Second operand 3 states. [2018-06-26 20:32:30,059 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:30,059 INFO ]: Finished difference Result 9 states and 179 transitions. [2018-06-26 20:32:30,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:30,063 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:32:30,063 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:30,064 INFO ]: With dead ends: 9 [2018-06-26 20:32:30,064 INFO ]: Without dead ends: 9 [2018-06-26 20:32:30,065 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:30,065 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:32:30,068 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:32:30,068 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:32:30,068 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2018-06-26 20:32:30,068 INFO ]: Start accepts. Automaton has 9 states and 179 transitions. Word has length 6 [2018-06-26 20:32:30,068 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:30,068 INFO ]: Abstraction has 9 states and 179 transitions. [2018-06-26 20:32:30,068 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:30,069 INFO ]: Start isEmpty. Operand 9 states and 179 transitions. [2018-06-26 20:32:30,070 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:32:30,070 INFO ]: Found error trace [2018-06-26 20:32:30,070 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:30,071 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:30,071 INFO ]: Analyzing trace with hash -2106147503, now seen corresponding path program 1 times [2018-06-26 20:32:30,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:30,071 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:30,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:30,071 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:30,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:30,116 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:30,214 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:32:30,214 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:30,265 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:30,265 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:30,265 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:30,265 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:30,265 INFO ]: Start difference. First operand 9 states and 179 transitions. Second operand 3 states. [2018-06-26 20:32:30,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:30,864 INFO ]: Finished difference Result 13 states and 273 transitions. [2018-06-26 20:32:30,864 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:30,864 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:32:30,864 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:30,866 INFO ]: With dead ends: 13 [2018-06-26 20:32:30,866 INFO ]: Without dead ends: 13 [2018-06-26 20:32:30,866 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:30,866 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:32:30,870 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 20:32:30,870 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:32:30,871 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 273 transitions. [2018-06-26 20:32:30,871 INFO ]: Start accepts. Automaton has 13 states and 273 transitions. Word has length 7 [2018-06-26 20:32:30,871 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:30,871 INFO ]: Abstraction has 13 states and 273 transitions. [2018-06-26 20:32:30,871 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:30,871 INFO ]: Start isEmpty. Operand 13 states and 273 transitions. [2018-06-26 20:32:30,872 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:32:30,872 INFO ]: Found error trace [2018-06-26 20:32:30,872 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:30,872 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:30,872 INFO ]: Analyzing trace with hash -2107696635, now seen corresponding path program 1 times [2018-06-26 20:32:30,872 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:30,872 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:30,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:30,873 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:30,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:30,930 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:31,009 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:32:31,009 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:31,010 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:31,010 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:31,010 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:31,010 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:31,010 INFO ]: Start difference. First operand 13 states and 273 transitions. Second operand 3 states. [2018-06-26 20:32:31,518 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:31,518 INFO ]: Finished difference Result 20 states and 436 transitions. [2018-06-26 20:32:31,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:31,519 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:32:31,519 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:31,520 INFO ]: With dead ends: 20 [2018-06-26 20:32:31,520 INFO ]: Without dead ends: 20 [2018-06-26 20:32:31,520 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:31,520 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 20:32:31,525 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 20:32:31,526 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 20:32:31,527 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 436 transitions. [2018-06-26 20:32:31,527 INFO ]: Start accepts. Automaton has 20 states and 436 transitions. Word has length 7 [2018-06-26 20:32:31,527 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:31,527 INFO ]: Abstraction has 20 states and 436 transitions. [2018-06-26 20:32:31,527 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:31,527 INFO ]: Start isEmpty. Operand 20 states and 436 transitions. [2018-06-26 20:32:31,528 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:32:31,528 INFO ]: Found error trace [2018-06-26 20:32:31,528 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:31,528 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:31,528 INFO ]: Analyzing trace with hash -2114161282, now seen corresponding path program 1 times [2018-06-26 20:32:31,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:31,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:31,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:31,529 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:31,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:31,552 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:31,583 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:32:31,583 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:31,583 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:31,584 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:31,584 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:31,584 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:31,584 INFO ]: Start difference. First operand 20 states and 436 transitions. Second operand 3 states. [2018-06-26 20:32:32,012 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:32,012 INFO ]: Finished difference Result 20 states and 276 transitions. [2018-06-26 20:32:32,012 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:32,012 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:32:32,012 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:32,013 INFO ]: With dead ends: 20 [2018-06-26 20:32:32,013 INFO ]: Without dead ends: 20 [2018-06-26 20:32:32,013 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:32,013 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 20:32:32,017 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 20:32:32,017 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 20:32:32,018 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 276 transitions. [2018-06-26 20:32:32,018 INFO ]: Start accepts. Automaton has 20 states and 276 transitions. Word has length 7 [2018-06-26 20:32:32,018 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:32,018 INFO ]: Abstraction has 20 states and 276 transitions. [2018-06-26 20:32:32,018 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:32,018 INFO ]: Start isEmpty. Operand 20 states and 276 transitions. [2018-06-26 20:32:32,018 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:32:32,018 INFO ]: Found error trace [2018-06-26 20:32:32,018 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:32,019 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:32,019 INFO ]: Analyzing trace with hash 948712470, now seen corresponding path program 1 times [2018-06-26 20:32:32,019 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:32,019 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:32,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:32,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:32,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:32,043 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:32,111 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:32:32,111 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:32,112 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:32,112 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:32,112 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:32,112 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:32,112 INFO ]: Start difference. First operand 20 states and 276 transitions. Second operand 3 states. [2018-06-26 20:32:32,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:32,703 INFO ]: Finished difference Result 31 states and 359 transitions. [2018-06-26 20:32:32,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:32,704 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:32:32,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:32,705 INFO ]: With dead ends: 31 [2018-06-26 20:32:32,705 INFO ]: Without dead ends: 31 [2018-06-26 20:32:32,706 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:32,706 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 20:32:32,735 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 20:32:32,735 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 20:32:32,736 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 359 transitions. [2018-06-26 20:32:32,736 INFO ]: Start accepts. Automaton has 31 states and 359 transitions. Word has length 8 [2018-06-26 20:32:32,736 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:32,736 INFO ]: Abstraction has 31 states and 359 transitions. [2018-06-26 20:32:32,736 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:32,736 INFO ]: Start isEmpty. Operand 31 states and 359 transitions. [2018-06-26 20:32:32,738 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:32:32,738 INFO ]: Found error trace [2018-06-26 20:32:32,738 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:32,738 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:32,738 INFO ]: Analyzing trace with hash -1118336065, now seen corresponding path program 1 times [2018-06-26 20:32:32,738 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:32,738 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:32,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:32,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:32,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:32,760 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:32,832 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:32:32,832 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:32,832 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:32,832 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:32,832 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:32,832 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:32,832 INFO ]: Start difference. First operand 31 states and 359 transitions. Second operand 3 states. [2018-06-26 20:32:33,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:33,261 INFO ]: Finished difference Result 31 states and 247 transitions. [2018-06-26 20:32:33,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:33,261 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:32:33,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:33,262 INFO ]: With dead ends: 31 [2018-06-26 20:32:33,262 INFO ]: Without dead ends: 31 [2018-06-26 20:32:33,262 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:33,262 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 20:32:33,267 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 20:32:33,267 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 20:32:33,268 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 247 transitions. [2018-06-26 20:32:33,268 INFO ]: Start accepts. Automaton has 31 states and 247 transitions. Word has length 8 [2018-06-26 20:32:33,268 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:33,268 INFO ]: Abstraction has 31 states and 247 transitions. [2018-06-26 20:32:33,268 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:33,268 INFO ]: Start isEmpty. Operand 31 states and 247 transitions. [2018-06-26 20:32:33,271 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:32:33,271 INFO ]: Found error trace [2018-06-26 20:32:33,271 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:33,271 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:33,272 INFO ]: Analyzing trace with hash 4331666, now seen corresponding path program 1 times [2018-06-26 20:32:33,272 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:33,272 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:33,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:33,272 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:33,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:33,295 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:33,366 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:32:33,367 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:33,367 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:33,367 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:33,367 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:33,367 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:33,367 INFO ]: Start difference. First operand 31 states and 247 transitions. Second operand 3 states. [2018-06-26 20:32:33,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:33,933 INFO ]: Finished difference Result 31 states and 175 transitions. [2018-06-26 20:32:33,933 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:33,933 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:32:33,934 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:33,934 INFO ]: With dead ends: 31 [2018-06-26 20:32:33,934 INFO ]: Without dead ends: 31 [2018-06-26 20:32:33,935 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:33,935 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 20:32:33,938 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 20:32:33,938 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 20:32:33,939 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 175 transitions. [2018-06-26 20:32:33,939 INFO ]: Start accepts. Automaton has 31 states and 175 transitions. Word has length 9 [2018-06-26 20:32:33,939 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:33,939 INFO ]: Abstraction has 31 states and 175 transitions. [2018-06-26 20:32:33,939 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:33,939 INFO ]: Start isEmpty. Operand 31 states and 175 transitions. [2018-06-26 20:32:33,940 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:32:33,940 INFO ]: Found error trace [2018-06-26 20:32:33,940 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:33,940 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:33,940 INFO ]: Analyzing trace with hash 68267054, now seen corresponding path program 1 times [2018-06-26 20:32:33,940 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:33,940 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:33,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:33,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:33,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:33,980 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:34,164 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:32:34,164 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:34,164 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:34,164 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:34,164 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:34,164 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:34,164 INFO ]: Start difference. First operand 31 states and 175 transitions. Second operand 3 states. [2018-06-26 20:32:35,340 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:35,340 INFO ]: Finished difference Result 55 states and 330 transitions. [2018-06-26 20:32:35,371 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:35,371 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:32:35,371 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:35,373 INFO ]: With dead ends: 55 [2018-06-26 20:32:35,373 INFO ]: Without dead ends: 55 [2018-06-26 20:32:35,373 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-26 20:32:35,373 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-26 20:32:35,377 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-26 20:32:35,378 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-26 20:32:35,379 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 330 transitions. [2018-06-26 20:32:35,379 INFO ]: Start accepts. Automaton has 55 states and 330 transitions. Word has length 10 [2018-06-26 20:32:35,379 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:35,379 INFO ]: Abstraction has 55 states and 330 transitions. [2018-06-26 20:32:35,379 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:35,379 INFO ]: Start isEmpty. Operand 55 states and 330 transitions. [2018-06-26 20:32:35,380 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:32:35,380 INFO ]: Found error trace [2018-06-26 20:32:35,380 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:35,380 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:35,380 INFO ]: Analyzing trace with hash -933839374, now seen corresponding path program 1 times [2018-06-26 20:32:35,380 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:35,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:35,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:35,381 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:35,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:35,406 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:35,459 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:32:35,459 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:35,459 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:35,460 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:35,460 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:35,460 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:35,460 INFO ]: Start difference. First operand 55 states and 330 transitions. Second operand 3 states. [2018-06-26 20:32:36,122 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:36,122 INFO ]: Finished difference Result 55 states and 240 transitions. [2018-06-26 20:32:36,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:36,123 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:32:36,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:36,124 INFO ]: With dead ends: 55 [2018-06-26 20:32:36,124 INFO ]: Without dead ends: 55 [2018-06-26 20:32:36,124 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:36,125 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-26 20:32:36,129 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-06-26 20:32:36,129 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-26 20:32:36,130 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 234 transitions. [2018-06-26 20:32:36,130 INFO ]: Start accepts. Automaton has 54 states and 234 transitions. Word has length 10 [2018-06-26 20:32:36,130 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:36,130 INFO ]: Abstraction has 54 states and 234 transitions. [2018-06-26 20:32:36,130 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:36,130 INFO ]: Start isEmpty. Operand 54 states and 234 transitions. [2018-06-26 20:32:36,131 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:32:36,131 INFO ]: Found error trace [2018-06-26 20:32:36,131 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:36,131 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:36,131 INFO ]: Analyzing trace with hash 1008547719, now seen corresponding path program 1 times [2018-06-26 20:32:36,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:36,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:36,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:36,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:36,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:36,168 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:36,266 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:32:36,266 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:36,266 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:36,266 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:36,266 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:36,266 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:36,266 INFO ]: Start difference. First operand 54 states and 234 transitions. Second operand 3 states. [2018-06-26 20:32:37,237 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:37,237 INFO ]: Finished difference Result 101 states and 399 transitions. [2018-06-26 20:32:37,237 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:37,237 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:32:37,237 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:37,239 INFO ]: With dead ends: 101 [2018-06-26 20:32:37,239 INFO ]: Without dead ends: 101 [2018-06-26 20:32:37,239 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:37,239 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-26 20:32:37,246 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-06-26 20:32:37,246 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-26 20:32:37,248 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 397 transitions. [2018-06-26 20:32:37,248 INFO ]: Start accepts. Automaton has 100 states and 397 transitions. Word has length 11 [2018-06-26 20:32:37,248 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:37,248 INFO ]: Abstraction has 100 states and 397 transitions. [2018-06-26 20:32:37,248 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:37,248 INFO ]: Start isEmpty. Operand 100 states and 397 transitions. [2018-06-26 20:32:37,249 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:32:37,249 INFO ]: Found error trace [2018-06-26 20:32:37,249 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:37,249 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:37,249 INFO ]: Analyzing trace with hash -2015693774, now seen corresponding path program 1 times [2018-06-26 20:32:37,250 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:37,250 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:37,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:37,250 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:37,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:37,288 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:37,426 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 20:32:37,426 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:37,426 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:37,426 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:37,426 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:37,426 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:37,426 INFO ]: Start difference. First operand 100 states and 397 transitions. Second operand 3 states. [2018-06-26 20:32:38,122 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:38,122 INFO ]: Finished difference Result 184 states and 718 transitions. [2018-06-26 20:32:38,124 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:38,124 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:32:38,124 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:38,126 INFO ]: With dead ends: 184 [2018-06-26 20:32:38,126 INFO ]: Without dead ends: 184 [2018-06-26 20:32:38,126 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-26 20:32:38,126 INFO ]: Start minimizeSevpa. Operand 184 states. [2018-06-26 20:32:38,140 INFO ]: Finished minimizeSevpa. Reduced states from 184 to 175. [2018-06-26 20:32:38,140 INFO ]: Start removeUnreachable. Operand 175 states. [2018-06-26 20:32:38,143 INFO ]: Finished removeUnreachable. Reduced from 175 states to 175 states and 696 transitions. [2018-06-26 20:32:38,143 INFO ]: Start accepts. Automaton has 175 states and 696 transitions. Word has length 12 [2018-06-26 20:32:38,143 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:38,143 INFO ]: Abstraction has 175 states and 696 transitions. [2018-06-26 20:32:38,143 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:38,143 INFO ]: Start isEmpty. Operand 175 states and 696 transitions. [2018-06-26 20:32:38,145 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:32:38,145 INFO ]: Found error trace [2018-06-26 20:32:38,145 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:38,145 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:38,145 INFO ]: Analyzing trace with hash -476995261, now seen corresponding path program 1 times [2018-06-26 20:32:38,145 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:38,145 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:38,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:38,146 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:38,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:38,179 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:38,292 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 20:32:38,292 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:38,292 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:38,292 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:38,292 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:38,292 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:38,293 INFO ]: Start difference. First operand 175 states and 696 transitions. Second operand 3 states. [2018-06-26 20:32:39,201 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:39,201 INFO ]: Finished difference Result 330 states and 1298 transitions. [2018-06-26 20:32:39,202 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:39,202 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:32:39,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:39,205 INFO ]: With dead ends: 330 [2018-06-26 20:32:39,205 INFO ]: Without dead ends: 330 [2018-06-26 20:32:39,205 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:39,205 INFO ]: Start minimizeSevpa. Operand 330 states. [2018-06-26 20:32:39,235 INFO ]: Finished minimizeSevpa. Reduced states from 330 to 290. [2018-06-26 20:32:39,235 INFO ]: Start removeUnreachable. Operand 290 states. [2018-06-26 20:32:39,238 INFO ]: Finished removeUnreachable. Reduced from 290 states to 290 states and 1194 transitions. [2018-06-26 20:32:39,239 INFO ]: Start accepts. Automaton has 290 states and 1194 transitions. Word has length 13 [2018-06-26 20:32:39,239 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:39,239 INFO ]: Abstraction has 290 states and 1194 transitions. [2018-06-26 20:32:39,239 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:39,245 INFO ]: Start isEmpty. Operand 290 states and 1194 transitions. [2018-06-26 20:32:39,247 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:32:39,247 INFO ]: Found error trace [2018-06-26 20:32:39,247 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:39,247 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:39,247 INFO ]: Analyzing trace with hash -1194421831, now seen corresponding path program 1 times [2018-06-26 20:32:39,247 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:39,247 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:39,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:39,248 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:39,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:39,291 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:39,381 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 20:32:39,382 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:39,382 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:39,382 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:39,382 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:39,382 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:39,382 INFO ]: Start difference. First operand 290 states and 1194 transitions. Second operand 3 states. [2018-06-26 20:32:39,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:39,969 INFO ]: Finished difference Result 180 states and 523 transitions. [2018-06-26 20:32:39,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:39,970 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:32:39,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:39,971 INFO ]: With dead ends: 180 [2018-06-26 20:32:39,971 INFO ]: Without dead ends: 173 [2018-06-26 20:32:39,971 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:39,971 INFO ]: Start minimizeSevpa. Operand 173 states. [2018-06-26 20:32:39,981 INFO ]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-06-26 20:32:39,981 INFO ]: Start removeUnreachable. Operand 173 states. [2018-06-26 20:32:39,983 INFO ]: Finished removeUnreachable. Reduced from 173 states to 173 states and 514 transitions. [2018-06-26 20:32:39,983 INFO ]: Start accepts. Automaton has 173 states and 514 transitions. Word has length 13 [2018-06-26 20:32:39,984 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:39,984 INFO ]: Abstraction has 173 states and 514 transitions. [2018-06-26 20:32:39,984 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:39,984 INFO ]: Start isEmpty. Operand 173 states and 514 transitions. [2018-06-26 20:32:39,992 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 20:32:39,992 INFO ]: Found error trace [2018-06-26 20:32:39,992 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:39,992 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:39,992 INFO ]: Analyzing trace with hash 824153203, now seen corresponding path program 1 times [2018-06-26 20:32:39,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:39,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:39,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:39,993 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:39,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:40,031 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:40,155 INFO ]: Checked inductivity of 45 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-26 20:32:40,155 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:40,155 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:40,155 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:40,155 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:40,155 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:40,156 INFO ]: Start difference. First operand 173 states and 514 transitions. Second operand 3 states. [2018-06-26 20:32:40,546 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:40,546 INFO ]: Finished difference Result 176 states and 523 transitions. [2018-06-26 20:32:40,579 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:40,579 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 20:32:40,579 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:40,580 INFO ]: With dead ends: 176 [2018-06-26 20:32:40,580 INFO ]: Without dead ends: 176 [2018-06-26 20:32:40,580 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:40,581 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-26 20:32:40,591 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-06-26 20:32:40,591 INFO ]: Start removeUnreachable. Operand 174 states. [2018-06-26 20:32:40,592 INFO ]: Finished removeUnreachable. Reduced from 174 states to 174 states and 515 transitions. [2018-06-26 20:32:40,592 INFO ]: Start accepts. Automaton has 174 states and 515 transitions. Word has length 14 [2018-06-26 20:32:40,592 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:40,592 INFO ]: Abstraction has 174 states and 515 transitions. [2018-06-26 20:32:40,592 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:40,592 INFO ]: Start isEmpty. Operand 174 states and 515 transitions. [2018-06-26 20:32:40,593 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:32:40,593 INFO ]: Found error trace [2018-06-26 20:32:40,593 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:40,593 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:40,593 INFO ]: Analyzing trace with hash -1245814683, now seen corresponding path program 1 times [2018-06-26 20:32:40,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:40,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:40,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:40,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:40,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:40,635 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:40,788 INFO ]: Checked inductivity of 78 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 20:32:40,788 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:40,788 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:40,788 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:40,788 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:40,788 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:40,788 INFO ]: Start difference. First operand 174 states and 515 transitions. Second operand 3 states. [2018-06-26 20:32:41,213 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:41,213 INFO ]: Finished difference Result 300 states and 869 transitions. [2018-06-26 20:32:41,213 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:41,213 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:32:41,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:41,215 INFO ]: With dead ends: 300 [2018-06-26 20:32:41,215 INFO ]: Without dead ends: 300 [2018-06-26 20:32:41,215 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-26 20:32:41,215 INFO ]: Start minimizeSevpa. Operand 300 states. [2018-06-26 20:32:41,228 INFO ]: Finished minimizeSevpa. Reduced states from 300 to 299. [2018-06-26 20:32:41,229 INFO ]: Start removeUnreachable. Operand 299 states. [2018-06-26 20:32:41,231 INFO ]: Finished removeUnreachable. Reduced from 299 states to 299 states and 867 transitions. [2018-06-26 20:32:41,231 INFO ]: Start accepts. Automaton has 299 states and 867 transitions. Word has length 17 [2018-06-26 20:32:41,231 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:41,231 INFO ]: Abstraction has 299 states and 867 transitions. [2018-06-26 20:32:41,231 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:41,231 INFO ]: Start isEmpty. Operand 299 states and 867 transitions. [2018-06-26 20:32:41,232 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:32:41,232 INFO ]: Found error trace [2018-06-26 20:32:41,232 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:41,232 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:41,233 INFO ]: Analyzing trace with hash 1514228606, now seen corresponding path program 1 times [2018-06-26 20:32:41,233 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:41,233 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:41,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:41,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:41,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:41,281 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:41,416 INFO ]: Checked inductivity of 78 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-26 20:32:41,416 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:41,416 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:41,417 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:41,417 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:41,417 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:41,417 INFO ]: Start difference. First operand 299 states and 867 transitions. Second operand 3 states. [2018-06-26 20:32:42,000 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:42,000 INFO ]: Finished difference Result 532 states and 1379 transitions. [2018-06-26 20:32:42,001 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:42,001 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:32:42,001 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:42,003 INFO ]: With dead ends: 532 [2018-06-26 20:32:42,003 INFO ]: Without dead ends: 531 [2018-06-26 20:32:42,004 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-26 20:32:42,004 INFO ]: Start minimizeSevpa. Operand 531 states. [2018-06-26 20:32:42,019 INFO ]: Finished minimizeSevpa. Reduced states from 531 to 531. [2018-06-26 20:32:42,019 INFO ]: Start removeUnreachable. Operand 531 states. [2018-06-26 20:32:42,022 INFO ]: Finished removeUnreachable. Reduced from 531 states to 531 states and 1378 transitions. [2018-06-26 20:32:42,022 INFO ]: Start accepts. Automaton has 531 states and 1378 transitions. Word has length 17 [2018-06-26 20:32:42,022 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:42,022 INFO ]: Abstraction has 531 states and 1378 transitions. [2018-06-26 20:32:42,022 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:42,022 INFO ]: Start isEmpty. Operand 531 states and 1378 transitions. [2018-06-26 20:32:42,026 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:32:42,026 INFO ]: Found error trace [2018-06-26 20:32:42,027 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:42,027 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:42,027 INFO ]: Analyzing trace with hash 1318061747, now seen corresponding path program 1 times [2018-06-26 20:32:42,027 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:42,027 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:42,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:42,027 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:42,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:42,070 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:42,158 INFO ]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-26 20:32:42,158 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:42,158 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:42,159 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:42,159 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:42,159 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:42,159 INFO ]: Start difference. First operand 531 states and 1378 transitions. Second operand 3 states. [2018-06-26 20:32:42,595 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:42,595 INFO ]: Finished difference Result 675 states and 1729 transitions. [2018-06-26 20:32:42,595 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:42,595 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:32:42,595 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:42,599 INFO ]: With dead ends: 675 [2018-06-26 20:32:42,599 INFO ]: Without dead ends: 675 [2018-06-26 20:32:42,599 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-26 20:32:42,599 INFO ]: Start minimizeSevpa. Operand 675 states. [2018-06-26 20:32:42,616 INFO ]: Finished minimizeSevpa. Reduced states from 675 to 557. [2018-06-26 20:32:42,616 INFO ]: Start removeUnreachable. Operand 557 states. [2018-06-26 20:32:42,618 INFO ]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1461 transitions. [2018-06-26 20:32:42,618 INFO ]: Start accepts. Automaton has 557 states and 1461 transitions. Word has length 17 [2018-06-26 20:32:42,619 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:42,619 INFO ]: Abstraction has 557 states and 1461 transitions. [2018-06-26 20:32:42,619 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:42,619 INFO ]: Start isEmpty. Operand 557 states and 1461 transitions. [2018-06-26 20:32:42,620 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:32:42,620 INFO ]: Found error trace [2018-06-26 20:32:42,620 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:42,620 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:42,621 INFO ]: Analyzing trace with hash -1783664855, now seen corresponding path program 1 times [2018-06-26 20:32:42,621 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:42,621 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:42,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:42,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:42,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:42,662 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:42,843 INFO ]: Checked inductivity of 91 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-26 20:32:42,843 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:32:42,843 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:32:42,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:43,444 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:43,471 INFO ]: Computing forward predicates... [2018-06-26 20:32:43,706 INFO ]: Checked inductivity of 91 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-26 20:32:43,742 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:32:43,742 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 20:32:43,742 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:32:43,742 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:32:43,742 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:32:43,743 INFO ]: Start difference. First operand 557 states and 1461 transitions. Second operand 6 states. [2018-06-26 20:32:44,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:44,939 INFO ]: Finished difference Result 968 states and 2451 transitions. [2018-06-26 20:32:44,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 20:32:44,939 INFO ]: Start accepts. Automaton has 6 states. Word has length 18 [2018-06-26 20:32:44,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:44,949 INFO ]: With dead ends: 968 [2018-06-26 20:32:44,949 INFO ]: Without dead ends: 968 [2018-06-26 20:32:44,949 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:32:44,950 INFO ]: Start minimizeSevpa. Operand 968 states. [2018-06-26 20:32:44,981 INFO ]: Finished minimizeSevpa. Reduced states from 968 to 959. [2018-06-26 20:32:44,981 INFO ]: Start removeUnreachable. Operand 959 states. [2018-06-26 20:32:44,984 INFO ]: Finished removeUnreachable. Reduced from 959 states to 959 states and 2439 transitions. [2018-06-26 20:32:44,984 INFO ]: Start accepts. Automaton has 959 states and 2439 transitions. Word has length 18 [2018-06-26 20:32:44,985 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:44,985 INFO ]: Abstraction has 959 states and 2439 transitions. [2018-06-26 20:32:44,985 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:32:44,985 INFO ]: Start isEmpty. Operand 959 states and 2439 transitions. [2018-06-26 20:32:44,987 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:32:44,987 INFO ]: Found error trace [2018-06-26 20:32:44,988 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:44,988 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:44,988 INFO ]: Analyzing trace with hash -1106069477, now seen corresponding path program 1 times [2018-06-26 20:32:44,988 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:44,988 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:44,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:44,989 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:44,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:45,041 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:45,317 INFO ]: Checked inductivity of 91 backedges. 51 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-26 20:32:45,317 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:32:45,317 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 20:32:45,330 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:32:45,896 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:45,920 INFO ]: Computing forward predicates... [2018-06-26 20:32:46,030 INFO ]: Checked inductivity of 91 backedges. 51 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-26 20:32:46,066 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:32:46,066 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 20:32:46,067 INFO ]: Interpolant automaton has 5 states [2018-06-26 20:32:46,067 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 20:32:46,067 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 20:32:46,067 INFO ]: Start difference. First operand 959 states and 2439 transitions. Second operand 5 states. [2018-06-26 20:32:47,479 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:47,480 INFO ]: Finished difference Result 983 states and 2497 transitions. [2018-06-26 20:32:47,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 20:32:47,480 INFO ]: Start accepts. Automaton has 5 states. Word has length 18 [2018-06-26 20:32:47,480 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:47,485 INFO ]: With dead ends: 983 [2018-06-26 20:32:47,485 INFO ]: Without dead ends: 983 [2018-06-26 20:32:47,485 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-26 20:32:47,486 INFO ]: Start minimizeSevpa. Operand 983 states. [2018-06-26 20:32:47,511 INFO ]: Finished minimizeSevpa. Reduced states from 983 to 969. [2018-06-26 20:32:47,511 INFO ]: Start removeUnreachable. Operand 969 states. [2018-06-26 20:32:47,515 INFO ]: Finished removeUnreachable. Reduced from 969 states to 969 states and 2458 transitions. [2018-06-26 20:32:47,515 INFO ]: Start accepts. Automaton has 969 states and 2458 transitions. Word has length 18 [2018-06-26 20:32:47,515 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:47,515 INFO ]: Abstraction has 969 states and 2458 transitions. [2018-06-26 20:32:47,515 INFO ]: Interpolant automaton has 5 states. [2018-06-26 20:32:47,515 INFO ]: Start isEmpty. Operand 969 states and 2458 transitions. [2018-06-26 20:32:47,517 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 20:32:47,517 INFO ]: Found error trace [2018-06-26 20:32:47,517 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:32:47,518 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:47,518 INFO ]: Analyzing trace with hash -2085306241, now seen corresponding path program 1 times [2018-06-26 20:32:47,518 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:47,518 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:47,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:47,518 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:47,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:47,557 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:47,662 INFO ]: Checked inductivity of 91 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-26 20:32:47,662 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:47,662 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:47,662 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:47,663 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:47,663 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:47,663 INFO ]: Start difference. First operand 969 states and 2458 transitions. Second operand 3 states. [2018-06-26 20:32:48,229 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:48,229 INFO ]: Finished difference Result 1554 states and 3438 transitions. [2018-06-26 20:32:48,229 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:48,229 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 20:32:48,229 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:48,236 INFO ]: With dead ends: 1554 [2018-06-26 20:32:48,236 INFO ]: Without dead ends: 1453 [2018-06-26 20:32:48,236 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-26 20:32:48,236 INFO ]: Start minimizeSevpa. Operand 1453 states. [2018-06-26 20:32:48,270 INFO ]: Finished minimizeSevpa. Reduced states from 1453 to 1073. [2018-06-26 20:32:48,270 INFO ]: Start removeUnreachable. Operand 1073 states. [2018-06-26 20:32:48,274 INFO ]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 2439 transitions. [2018-06-26 20:32:48,274 INFO ]: Start accepts. Automaton has 1073 states and 2439 transitions. Word has length 18 [2018-06-26 20:32:48,274 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:48,274 INFO ]: Abstraction has 1073 states and 2439 transitions. [2018-06-26 20:32:48,274 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:48,274 INFO ]: Start isEmpty. Operand 1073 states and 2439 transitions. [2018-06-26 20:32:48,278 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 20:32:48,278 INFO ]: Found error trace [2018-06-26 20:32:48,278 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-26 20:32:48,278 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:48,278 INFO ]: Analyzing trace with hash -1220744778, now seen corresponding path program 1 times [2018-06-26 20:32:48,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:48,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:48,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:48,279 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:48,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:48,316 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:48,419 INFO ]: Checked inductivity of 153 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 20:32:48,419 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:48,419 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:48,420 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:48,420 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:48,420 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:48,420 INFO ]: Start difference. First operand 1073 states and 2439 transitions. Second operand 3 states. [2018-06-26 20:32:49,120 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:49,120 INFO ]: Finished difference Result 1483 states and 3212 transitions. [2018-06-26 20:32:49,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:49,121 INFO ]: Start accepts. Automaton has 3 states. Word has length 22 [2018-06-26 20:32:49,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:49,159 INFO ]: With dead ends: 1483 [2018-06-26 20:32:49,159 INFO ]: Without dead ends: 1451 [2018-06-26 20:32:49,159 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-26 20:32:49,160 INFO ]: Start minimizeSevpa. Operand 1451 states. [2018-06-26 20:32:49,192 INFO ]: Finished minimizeSevpa. Reduced states from 1451 to 1407. [2018-06-26 20:32:49,193 INFO ]: Start removeUnreachable. Operand 1407 states. [2018-06-26 20:32:49,198 INFO ]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 3103 transitions. [2018-06-26 20:32:49,198 INFO ]: Start accepts. Automaton has 1407 states and 3103 transitions. Word has length 22 [2018-06-26 20:32:49,198 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:49,198 INFO ]: Abstraction has 1407 states and 3103 transitions. [2018-06-26 20:32:49,198 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:49,198 INFO ]: Start isEmpty. Operand 1407 states and 3103 transitions. [2018-06-26 20:32:49,205 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 20:32:49,205 INFO ]: Found error trace [2018-06-26 20:32:49,205 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-26 20:32:49,205 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:49,205 INFO ]: Analyzing trace with hash -533602539, now seen corresponding path program 1 times [2018-06-26 20:32:49,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:49,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:49,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:49,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:49,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:49,250 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:49,499 WARN ]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-26 20:32:49,785 INFO ]: Checked inductivity of 190 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-26 20:32:49,786 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:49,786 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:49,786 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:49,786 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:49,786 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:49,786 INFO ]: Start difference. First operand 1407 states and 3103 transitions. Second operand 3 states. [2018-06-26 20:32:50,202 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:50,202 INFO ]: Finished difference Result 2063 states and 4363 transitions. [2018-06-26 20:32:50,202 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:50,202 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-26 20:32:50,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:50,209 INFO ]: With dead ends: 2063 [2018-06-26 20:32:50,209 INFO ]: Without dead ends: 2063 [2018-06-26 20:32:50,209 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:50,210 INFO ]: Start minimizeSevpa. Operand 2063 states. [2018-06-26 20:32:50,251 INFO ]: Finished minimizeSevpa. Reduced states from 2063 to 2010. [2018-06-26 20:32:50,251 INFO ]: Start removeUnreachable. Operand 2010 states. [2018-06-26 20:32:50,257 INFO ]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4275 transitions. [2018-06-26 20:32:50,257 INFO ]: Start accepts. Automaton has 2010 states and 4275 transitions. Word has length 24 [2018-06-26 20:32:50,258 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:50,258 INFO ]: Abstraction has 2010 states and 4275 transitions. [2018-06-26 20:32:50,258 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:50,258 INFO ]: Start isEmpty. Operand 2010 states and 4275 transitions. [2018-06-26 20:32:50,263 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 20:32:50,263 INFO ]: Found error trace [2018-06-26 20:32:50,263 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-26 20:32:50,263 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:50,263 INFO ]: Analyzing trace with hash -1919370185, now seen corresponding path program 1 times [2018-06-26 20:32:50,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:50,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:50,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:50,264 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:50,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:50,318 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:50,528 INFO ]: Checked inductivity of 190 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-26 20:32:50,529 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:50,529 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:50,529 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:50,529 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:50,529 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:50,529 INFO ]: Start difference. First operand 2010 states and 4275 transitions. Second operand 3 states. [2018-06-26 20:32:51,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:51,284 INFO ]: Finished difference Result 2381 states and 4846 transitions. [2018-06-26 20:32:51,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:51,305 INFO ]: Start accepts. Automaton has 3 states. Word has length 24 [2018-06-26 20:32:51,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:51,311 INFO ]: With dead ends: 2381 [2018-06-26 20:32:51,311 INFO ]: Without dead ends: 2378 [2018-06-26 20:32:51,311 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-26 20:32:51,312 INFO ]: Start minimizeSevpa. Operand 2378 states. [2018-06-26 20:32:51,357 INFO ]: Finished minimizeSevpa. Reduced states from 2378 to 2345. [2018-06-26 20:32:51,357 INFO ]: Start removeUnreachable. Operand 2345 states. [2018-06-26 20:32:51,364 INFO ]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 4787 transitions. [2018-06-26 20:32:51,364 INFO ]: Start accepts. Automaton has 2345 states and 4787 transitions. Word has length 24 [2018-06-26 20:32:51,365 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:51,365 INFO ]: Abstraction has 2345 states and 4787 transitions. [2018-06-26 20:32:51,365 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:51,365 INFO ]: Start isEmpty. Operand 2345 states and 4787 transitions. [2018-06-26 20:32:51,371 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 20:32:51,371 INFO ]: Found error trace [2018-06-26 20:32:51,371 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-26 20:32:51,371 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:51,371 INFO ]: Analyzing trace with hash 440593347, now seen corresponding path program 1 times [2018-06-26 20:32:51,371 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:51,371 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:51,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:51,372 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:51,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:51,431 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:51,544 INFO ]: Checked inductivity of 210 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-06-26 20:32:51,545 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:51,545 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:51,545 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:51,545 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:51,545 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:51,545 INFO ]: Start difference. First operand 2345 states and 4787 transitions. Second operand 3 states. [2018-06-26 20:32:51,953 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:51,953 INFO ]: Finished difference Result 2957 states and 5689 transitions. [2018-06-26 20:32:51,953 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:51,954 INFO ]: Start accepts. Automaton has 3 states. Word has length 25 [2018-06-26 20:32:51,954 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:51,962 INFO ]: With dead ends: 2957 [2018-06-26 20:32:51,962 INFO ]: Without dead ends: 2939 [2018-06-26 20:32:51,962 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-26 20:32:51,964 INFO ]: Start minimizeSevpa. Operand 2939 states. [2018-06-26 20:32:52,026 INFO ]: Finished minimizeSevpa. Reduced states from 2939 to 2841. [2018-06-26 20:32:52,026 INFO ]: Start removeUnreachable. Operand 2841 states. [2018-06-26 20:32:52,037 INFO ]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 5482 transitions. [2018-06-26 20:32:52,037 INFO ]: Start accepts. Automaton has 2841 states and 5482 transitions. Word has length 25 [2018-06-26 20:32:52,037 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:52,037 INFO ]: Abstraction has 2841 states and 5482 transitions. [2018-06-26 20:32:52,037 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:52,037 INFO ]: Start isEmpty. Operand 2841 states and 5482 transitions. [2018-06-26 20:32:52,097 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 20:32:52,097 INFO ]: Found error trace [2018-06-26 20:32:52,098 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-26 20:32:52,098 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:52,098 INFO ]: Analyzing trace with hash -1217998225, now seen corresponding path program 1 times [2018-06-26 20:32:52,098 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:52,098 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:52,098 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:52,098 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:52,098 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:52,170 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:52,502 INFO ]: Checked inductivity of 325 backedges. 221 proven. 12 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-26 20:32:52,502 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:32:52,502 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-26 20:32:52,514 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-26 20:32:53,395 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:53,426 INFO ]: Computing forward predicates... [2018-06-26 20:32:53,464 INFO ]: Checked inductivity of 325 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-06-26 20:32:53,496 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 20:32:53,496 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-26 20:32:53,497 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:32:53,497 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:32:53,497 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:32:53,497 INFO ]: Start difference. First operand 2841 states and 5482 transitions. Second operand 6 states. [2018-06-26 20:32:54,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:54,138 INFO ]: Finished difference Result 3580 states and 6469 transitions. [2018-06-26 20:32:54,139 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 20:32:54,139 INFO ]: Start accepts. Automaton has 6 states. Word has length 30 [2018-06-26 20:32:54,139 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:54,147 INFO ]: With dead ends: 3580 [2018-06-26 20:32:54,147 INFO ]: Without dead ends: 3522 [2018-06-26 20:32:54,148 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-26 20:32:54,149 INFO ]: Start minimizeSevpa. Operand 3522 states. [2018-06-26 20:32:54,262 INFO ]: Finished minimizeSevpa. Reduced states from 3522 to 2591. [2018-06-26 20:32:54,262 INFO ]: Start removeUnreachable. Operand 2591 states. [2018-06-26 20:32:54,268 INFO ]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 4956 transitions. [2018-06-26 20:32:54,268 INFO ]: Start accepts. Automaton has 2591 states and 4956 transitions. Word has length 30 [2018-06-26 20:32:54,268 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:54,268 INFO ]: Abstraction has 2591 states and 4956 transitions. [2018-06-26 20:32:54,268 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:32:54,268 INFO ]: Start isEmpty. Operand 2591 states and 4956 transitions. [2018-06-26 20:32:54,273 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 20:32:54,273 INFO ]: Found error trace [2018-06-26 20:32:54,273 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-26 20:32:54,273 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:54,273 INFO ]: Analyzing trace with hash -138891191, now seen corresponding path program 1 times [2018-06-26 20:32:54,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:54,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:54,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:54,275 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:54,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:54,327 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:54,426 INFO ]: Checked inductivity of 378 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-06-26 20:32:54,426 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:54,426 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:54,426 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:54,426 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:54,426 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:54,426 INFO ]: Start difference. First operand 2591 states and 4956 transitions. Second operand 3 states. [2018-06-26 20:32:54,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:54,950 INFO ]: Finished difference Result 3064 states and 5676 transitions. [2018-06-26 20:32:54,951 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:54,951 INFO ]: Start accepts. Automaton has 3 states. Word has length 32 [2018-06-26 20:32:54,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:54,958 INFO ]: With dead ends: 3064 [2018-06-26 20:32:54,958 INFO ]: Without dead ends: 2878 [2018-06-26 20:32:54,958 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:54,959 INFO ]: Start minimizeSevpa. Operand 2878 states. [2018-06-26 20:32:55,012 INFO ]: Finished minimizeSevpa. Reduced states from 2878 to 2683. [2018-06-26 20:32:55,012 INFO ]: Start removeUnreachable. Operand 2683 states. [2018-06-26 20:32:55,018 INFO ]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4999 transitions. [2018-06-26 20:32:55,018 INFO ]: Start accepts. Automaton has 2683 states and 4999 transitions. Word has length 32 [2018-06-26 20:32:55,018 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:55,018 INFO ]: Abstraction has 2683 states and 4999 transitions. [2018-06-26 20:32:55,018 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:55,018 INFO ]: Start isEmpty. Operand 2683 states and 4999 transitions. [2018-06-26 20:32:55,023 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 20:32:55,024 INFO ]: Found error trace [2018-06-26 20:32:55,024 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-26 20:32:55,024 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:55,024 INFO ]: Analyzing trace with hash -1128502326, now seen corresponding path program 1 times [2018-06-26 20:32:55,024 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:55,024 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:55,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:55,024 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:55,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:55,094 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:55,213 INFO ]: Checked inductivity of 378 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-06-26 20:32:55,214 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:32:55,214 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:32:55,214 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:32:55,214 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:32:55,214 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:32:55,214 INFO ]: Start difference. First operand 2683 states and 4999 transitions. Second operand 3 states. [2018-06-26 20:32:55,771 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:55,771 INFO ]: Finished difference Result 4679 states and 8198 transitions. [2018-06-26 20:32:55,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:32:55,772 INFO ]: Start accepts. Automaton has 3 states. Word has length 32 [2018-06-26 20:32:55,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:55,780 INFO ]: With dead ends: 4679 [2018-06-26 20:32:55,780 INFO ]: Without dead ends: 4393 [2018-06-26 20:32:55,780 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-26 20:32:55,782 INFO ]: Start minimizeSevpa. Operand 4393 states. [2018-06-26 20:32:55,844 INFO ]: Finished minimizeSevpa. Reduced states from 4393 to 3041. [2018-06-26 20:32:55,844 INFO ]: Start removeUnreachable. Operand 3041 states. [2018-06-26 20:32:55,850 INFO ]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 5623 transitions. [2018-06-26 20:32:55,850 INFO ]: Start accepts. Automaton has 3041 states and 5623 transitions. Word has length 32 [2018-06-26 20:32:55,850 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:55,850 INFO ]: Abstraction has 3041 states and 5623 transitions. [2018-06-26 20:32:55,850 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:32:55,850 INFO ]: Start isEmpty. Operand 3041 states and 5623 transitions. [2018-06-26 20:32:55,855 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 20:32:55,855 INFO ]: Found error trace [2018-06-26 20:32:55,855 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-26 20:32:55,855 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:55,855 INFO ]: Analyzing trace with hash 533173136, now seen corresponding path program 1 times [2018-06-26 20:32:55,855 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:55,855 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:55,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:55,856 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:55,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:55,932 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:56,145 INFO ]: Checked inductivity of 406 backedges. 156 proven. 163 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-26 20:32:56,145 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:32:56,145 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:32:56,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:57,060 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:57,093 INFO ]: Computing forward predicates... [2018-06-26 20:32:57,137 INFO ]: Checked inductivity of 406 backedges. 146 proven. 156 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-06-26 20:32:57,163 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:32:57,163 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-06-26 20:32:57,163 INFO ]: Interpolant automaton has 10 states [2018-06-26 20:32:57,163 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 20:32:57,163 INFO ]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-26 20:32:57,163 INFO ]: Start difference. First operand 3041 states and 5623 transitions. Second operand 10 states. [2018-06-26 20:32:59,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:32:59,424 INFO ]: Finished difference Result 8005 states and 14267 transitions. [2018-06-26 20:32:59,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 20:32:59,425 INFO ]: Start accepts. Automaton has 10 states. Word has length 33 [2018-06-26 20:32:59,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:32:59,433 INFO ]: With dead ends: 8005 [2018-06-26 20:32:59,433 INFO ]: Without dead ends: 4635 [2018-06-26 20:32:59,433 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-06-26 20:32:59,437 INFO ]: Start minimizeSevpa. Operand 4635 states. [2018-06-26 20:32:59,490 INFO ]: Finished minimizeSevpa. Reduced states from 4635 to 3997. [2018-06-26 20:32:59,490 INFO ]: Start removeUnreachable. Operand 3997 states. [2018-06-26 20:32:59,496 INFO ]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 7347 transitions. [2018-06-26 20:32:59,497 INFO ]: Start accepts. Automaton has 3997 states and 7347 transitions. Word has length 33 [2018-06-26 20:32:59,497 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:32:59,497 INFO ]: Abstraction has 3997 states and 7347 transitions. [2018-06-26 20:32:59,497 INFO ]: Interpolant automaton has 10 states. [2018-06-26 20:32:59,497 INFO ]: Start isEmpty. Operand 3997 states and 7347 transitions. [2018-06-26 20:32:59,503 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 20:32:59,503 INFO ]: Found error trace [2018-06-26 20:32:59,503 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-26 20:32:59,503 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:32:59,504 INFO ]: Analyzing trace with hash 1061858539, now seen corresponding path program 1 times [2018-06-26 20:32:59,504 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:32:59,504 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:32:59,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:59,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:32:59,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:32:59,576 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:32:59,713 INFO ]: Checked inductivity of 406 backedges. 126 proven. 179 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-06-26 20:32:59,713 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:32:59,713 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:32:59,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:00,538 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:00,568 INFO ]: Computing forward predicates... [2018-06-26 20:33:00,602 INFO ]: Checked inductivity of 406 backedges. 227 proven. 72 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-06-26 20:33:00,628 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:33:00,628 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-06-26 20:33:00,628 INFO ]: Interpolant automaton has 9 states [2018-06-26 20:33:00,628 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 20:33:00,628 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-26 20:33:00,628 INFO ]: Start difference. First operand 3997 states and 7347 transitions. Second operand 9 states. [2018-06-26 20:33:02,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:02,576 INFO ]: Finished difference Result 8681 states and 15610 transitions. [2018-06-26 20:33:02,577 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 20:33:02,577 INFO ]: Start accepts. Automaton has 9 states. Word has length 33 [2018-06-26 20:33:02,577 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:02,584 INFO ]: With dead ends: 8681 [2018-06-26 20:33:02,584 INFO ]: Without dead ends: 3999 [2018-06-26 20:33:02,585 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2018-06-26 20:33:02,586 INFO ]: Start minimizeSevpa. Operand 3999 states. [2018-06-26 20:33:02,631 INFO ]: Finished minimizeSevpa. Reduced states from 3999 to 3929. [2018-06-26 20:33:02,631 INFO ]: Start removeUnreachable. Operand 3929 states. [2018-06-26 20:33:02,639 INFO ]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 7105 transitions. [2018-06-26 20:33:02,639 INFO ]: Start accepts. Automaton has 3929 states and 7105 transitions. Word has length 33 [2018-06-26 20:33:02,639 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:02,639 INFO ]: Abstraction has 3929 states and 7105 transitions. [2018-06-26 20:33:02,640 INFO ]: Interpolant automaton has 9 states. [2018-06-26 20:33:02,640 INFO ]: Start isEmpty. Operand 3929 states and 7105 transitions. [2018-06-26 20:33:02,646 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 20:33:02,646 INFO ]: Found error trace [2018-06-26 20:33:02,646 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-26 20:33:02,646 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:02,646 INFO ]: Analyzing trace with hash 1187876972, now seen corresponding path program 1 times [2018-06-26 20:33:02,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:02,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:02,647 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:02,647 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:02,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:02,695 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:02,785 INFO ]: Checked inductivity of 465 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2018-06-26 20:33:02,785 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:02,785 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:02,785 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:02,786 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:02,786 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:02,786 INFO ]: Start difference. First operand 3929 states and 7105 transitions. Second operand 3 states. [2018-06-26 20:33:03,142 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:03,142 INFO ]: Finished difference Result 4635 states and 7925 transitions. [2018-06-26 20:33:03,142 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:03,142 INFO ]: Start accepts. Automaton has 3 states. Word has length 35 [2018-06-26 20:33:03,142 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:03,145 INFO ]: With dead ends: 4635 [2018-06-26 20:33:03,145 INFO ]: Without dead ends: 1877 [2018-06-26 20:33:03,145 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-26 20:33:03,145 INFO ]: Start minimizeSevpa. Operand 1877 states. [2018-06-26 20:33:03,152 INFO ]: Finished minimizeSevpa. Reduced states from 1877 to 1065. [2018-06-26 20:33:03,152 INFO ]: Start removeUnreachable. Operand 1065 states. [2018-06-26 20:33:03,153 INFO ]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1663 transitions. [2018-06-26 20:33:03,154 INFO ]: Start accepts. Automaton has 1065 states and 1663 transitions. Word has length 35 [2018-06-26 20:33:03,154 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:03,154 INFO ]: Abstraction has 1065 states and 1663 transitions. [2018-06-26 20:33:03,154 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:03,154 INFO ]: Start isEmpty. Operand 1065 states and 1663 transitions. [2018-06-26 20:33:03,155 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 20:33:03,155 INFO ]: Found error trace [2018-06-26 20:33:03,155 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-26 20:33:03,155 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:03,155 INFO ]: Analyzing trace with hash 204425029, now seen corresponding path program 1 times [2018-06-26 20:33:03,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:03,156 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:03,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:03,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:03,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:03,206 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:03,465 INFO ]: Checked inductivity of 465 backedges. 226 proven. 17 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-06-26 20:33:03,465 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:33:03,465 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 20:33:03,481 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:33:04,496 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:04,524 INFO ]: Computing forward predicates... [2018-06-26 20:33:04,546 INFO ]: Checked inductivity of 465 backedges. 226 proven. 17 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-06-26 20:33:04,571 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:33:04,571 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 20:33:04,571 INFO ]: Interpolant automaton has 5 states [2018-06-26 20:33:04,571 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 20:33:04,571 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 20:33:04,571 INFO ]: Start difference. First operand 1065 states and 1663 transitions. Second operand 5 states. [2018-06-26 20:33:04,985 WARN ]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-26 20:33:05,178 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:05,178 INFO ]: Finished difference Result 1106 states and 1712 transitions. [2018-06-26 20:33:05,179 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 20:33:05,179 INFO ]: Start accepts. Automaton has 5 states. Word has length 35 [2018-06-26 20:33:05,179 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:05,180 INFO ]: With dead ends: 1106 [2018-06-26 20:33:05,180 INFO ]: Without dead ends: 995 [2018-06-26 20:33:05,180 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:33:05,181 INFO ]: Start minimizeSevpa. Operand 995 states. [2018-06-26 20:33:05,188 INFO ]: Finished minimizeSevpa. Reduced states from 995 to 966. [2018-06-26 20:33:05,188 INFO ]: Start removeUnreachable. Operand 966 states. [2018-06-26 20:33:05,189 INFO ]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1506 transitions. [2018-06-26 20:33:05,189 INFO ]: Start accepts. Automaton has 966 states and 1506 transitions. Word has length 35 [2018-06-26 20:33:05,189 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:05,189 INFO ]: Abstraction has 966 states and 1506 transitions. [2018-06-26 20:33:05,189 INFO ]: Interpolant automaton has 5 states. [2018-06-26 20:33:05,189 INFO ]: Start isEmpty. Operand 966 states and 1506 transitions. [2018-06-26 20:33:05,191 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-26 20:33:05,191 INFO ]: Found error trace [2018-06-26 20:33:05,191 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-26 20:33:05,191 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:05,191 INFO ]: Analyzing trace with hash 73939111, now seen corresponding path program 1 times [2018-06-26 20:33:05,191 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:05,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:05,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:05,194 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:05,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:05,247 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:05,344 INFO ]: Checked inductivity of 666 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2018-06-26 20:33:05,344 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:05,344 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:05,344 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:05,344 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:05,344 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:05,345 INFO ]: Start difference. First operand 966 states and 1506 transitions. Second operand 3 states. [2018-06-26 20:33:05,732 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:05,732 INFO ]: Finished difference Result 982 states and 1502 transitions. [2018-06-26 20:33:05,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:05,732 INFO ]: Start accepts. Automaton has 3 states. Word has length 41 [2018-06-26 20:33:05,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:05,733 INFO ]: With dead ends: 982 [2018-06-26 20:33:05,733 INFO ]: Without dead ends: 978 [2018-06-26 20:33:05,734 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-26 20:33:05,734 INFO ]: Start minimizeSevpa. Operand 978 states. [2018-06-26 20:33:05,739 INFO ]: Finished minimizeSevpa. Reduced states from 978 to 802. [2018-06-26 20:33:05,739 INFO ]: Start removeUnreachable. Operand 802 states. [2018-06-26 20:33:05,740 INFO ]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1255 transitions. [2018-06-26 20:33:05,740 INFO ]: Start accepts. Automaton has 802 states and 1255 transitions. Word has length 41 [2018-06-26 20:33:05,740 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:05,740 INFO ]: Abstraction has 802 states and 1255 transitions. [2018-06-26 20:33:05,740 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:05,740 INFO ]: Start isEmpty. Operand 802 states and 1255 transitions. [2018-06-26 20:33:05,741 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-26 20:33:05,741 INFO ]: Found error trace [2018-06-26 20:33:05,741 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-26 20:33:05,741 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:05,741 INFO ]: Analyzing trace with hash -569567605, now seen corresponding path program 1 times [2018-06-26 20:33:05,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:05,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:05,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:05,742 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:05,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:05,834 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:06,005 INFO ]: Checked inductivity of 666 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-06-26 20:33:06,005 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:06,005 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:06,005 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:06,005 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:06,005 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:06,006 INFO ]: Start difference. First operand 802 states and 1255 transitions. Second operand 3 states. [2018-06-26 20:33:06,401 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:06,401 INFO ]: Finished difference Result 910 states and 1309 transitions. [2018-06-26 20:33:06,401 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:06,401 INFO ]: Start accepts. Automaton has 3 states. Word has length 41 [2018-06-26 20:33:06,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:06,401 INFO ]: With dead ends: 910 [2018-06-26 20:33:06,401 INFO ]: Without dead ends: 96 [2018-06-26 20:33:06,401 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-26 20:33:06,401 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-26 20:33:06,402 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 76. [2018-06-26 20:33:06,402 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-26 20:33:06,402 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2018-06-26 20:33:06,402 INFO ]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 41 [2018-06-26 20:33:06,402 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:06,402 INFO ]: Abstraction has 76 states and 98 transitions. [2018-06-26 20:33:06,402 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:06,402 INFO ]: Start isEmpty. Operand 76 states and 98 transitions. [2018-06-26 20:33:06,403 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-26 20:33:06,403 INFO ]: Found error trace [2018-06-26 20:33:06,403 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-26 20:33:06,403 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:06,403 INFO ]: Analyzing trace with hash 1875677905, now seen corresponding path program 1 times [2018-06-26 20:33:06,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:06,403 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:06,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:06,403 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:06,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:06,498 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:06,673 INFO ]: Checked inductivity of 741 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-06-26 20:33:06,673 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:33:06,674 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:33:06,674 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:33:06,674 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:33:06,674 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:33:06,674 INFO ]: Start difference. First operand 76 states and 98 transitions. Second operand 3 states. [2018-06-26 20:33:06,879 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:06,879 INFO ]: Finished difference Result 98 states and 125 transitions. [2018-06-26 20:33:06,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:33:06,879 INFO ]: Start accepts. Automaton has 3 states. Word has length 43 [2018-06-26 20:33:06,879 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:06,879 INFO ]: With dead ends: 98 [2018-06-26 20:33:06,879 INFO ]: Without dead ends: 82 [2018-06-26 20:33:06,879 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-26 20:33:06,879 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-26 20:33:06,880 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-06-26 20:33:06,880 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-26 20:33:06,880 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2018-06-26 20:33:06,880 INFO ]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 43 [2018-06-26 20:33:06,880 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:06,880 INFO ]: Abstraction has 76 states and 96 transitions. [2018-06-26 20:33:06,880 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:33:06,880 INFO ]: Start isEmpty. Operand 76 states and 96 transitions. [2018-06-26 20:33:06,880 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-26 20:33:06,880 INFO ]: Found error trace [2018-06-26 20:33:06,880 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-26 20:33:06,880 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:06,881 INFO ]: Analyzing trace with hash 1501027509, now seen corresponding path program 1 times [2018-06-26 20:33:06,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:06,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:06,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:06,881 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:06,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:06,964 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:07,434 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-26 20:33:07,844 INFO ]: Checked inductivity of 741 backedges. 266 proven. 365 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-26 20:33:07,844 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:33:07,861 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:33:07,867 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:09,119 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:09,164 INFO ]: Computing forward predicates... [2018-06-26 20:33:09,491 INFO ]: Checked inductivity of 741 backedges. 176 proven. 458 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-06-26 20:33:09,518 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:33:09,518 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2018-06-26 20:33:09,518 INFO ]: Interpolant automaton has 18 states [2018-06-26 20:33:09,518 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 20:33:09,518 INFO ]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-06-26 20:33:09,518 INFO ]: Start difference. First operand 76 states and 96 transitions. Second operand 18 states. [2018-06-26 20:33:10,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:10,140 INFO ]: Finished difference Result 118 states and 146 transitions. [2018-06-26 20:33:10,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 20:33:10,141 INFO ]: Start accepts. Automaton has 18 states. Word has length 43 [2018-06-26 20:33:10,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:10,141 INFO ]: With dead ends: 118 [2018-06-26 20:33:10,141 INFO ]: Without dead ends: 76 [2018-06-26 20:33:10,141 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-06-26 20:33:10,141 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-26 20:33:10,141 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-06-26 20:33:10,141 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-26 20:33:10,142 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2018-06-26 20:33:10,142 INFO ]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 43 [2018-06-26 20:33:10,142 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:10,142 INFO ]: Abstraction has 76 states and 95 transitions. [2018-06-26 20:33:10,142 INFO ]: Interpolant automaton has 18 states. [2018-06-26 20:33:10,142 INFO ]: Start isEmpty. Operand 76 states and 95 transitions. [2018-06-26 20:33:10,142 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-26 20:33:10,142 INFO ]: Found error trace [2018-06-26 20:33:10,142 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-26 20:33:10,142 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:33:10,142 INFO ]: Analyzing trace with hash 1775787123, now seen corresponding path program 1 times [2018-06-26 20:33:10,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:33:10,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:33:10,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:10,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:10,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:33:10,201 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:10,502 INFO ]: Checked inductivity of 741 backedges. 409 proven. 66 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-06-26 20:33:10,502 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:33:10,502 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:33:10,515 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:33:11,639 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:33:11,682 INFO ]: Computing forward predicates... [2018-06-26 20:33:11,946 INFO ]: Checked inductivity of 741 backedges. 444 proven. 10 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2018-06-26 20:33:11,986 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:33:11,986 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-06-26 20:33:11,986 INFO ]: Interpolant automaton has 7 states [2018-06-26 20:33:11,986 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 20:33:11,986 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-26 20:33:11,986 INFO ]: Start difference. First operand 76 states and 95 transitions. Second operand 7 states. [2018-06-26 20:33:12,584 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:33:12,584 INFO ]: Finished difference Result 34 states and 41 transitions. [2018-06-26 20:33:12,584 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 20:33:12,584 INFO ]: Start accepts. Automaton has 7 states. Word has length 43 [2018-06-26 20:33:12,584 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:33:12,584 INFO ]: With dead ends: 34 [2018-06-26 20:33:12,584 INFO ]: Without dead ends: 0 [2018-06-26 20:33:12,584 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-26 20:33:12,584 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 20:33:12,584 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 20:33:12,584 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 20:33:12,584 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 20:33:12,584 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-06-26 20:33:12,584 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:33:12,584 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 20:33:12,585 INFO ]: Interpolant automaton has 7 states. [2018-06-26 20:33:12,585 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 20:33:12,585 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 20:33:12,587 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:33:12,588 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:33:12 BasicIcfg [2018-06-26 20:33:12,588 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:33:12,595 INFO ]: Toolchain (without parser) took 47398.98 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 981.5 MB). Free memory was 197.8 MB in the beginning and 429.4 MB in the end (delta: -231.6 MB). Peak memory consumption was 749.8 MB. Max. memory is 3.6 GB. [2018-06-26 20:33:12,595 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:33:12,596 INFO ]: ChcToBoogie took 90.51 ms. Allocated memory is still 309.3 MB. Free memory was 197.8 MB in the beginning and 191.8 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:33:12,596 INFO ]: Boogie Preprocessor took 91.38 ms. Allocated memory was 309.3 MB in the beginning and 321.4 MB in the end (delta: 12.1 MB). Free memory was 191.8 MB in the beginning and 291.7 MB in the end (delta: -99.9 MB). Peak memory consumption was 6.8 MB. Max. memory is 3.6 GB. [2018-06-26 20:33:12,596 INFO ]: RCFGBuilder took 723.12 ms. Allocated memory is still 321.4 MB. Free memory was 291.7 MB in the beginning and 219.9 MB in the end (delta: 71.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 3.6 GB. [2018-06-26 20:33:12,597 INFO ]: BlockEncodingV2 took 553.16 ms. Allocated memory was 321.4 MB in the beginning and 366.5 MB in the end (delta: 45.1 MB). Free memory was 219.9 MB in the beginning and 272.2 MB in the end (delta: -52.3 MB). Peak memory consumption was 52.6 MB. Max. memory is 3.6 GB. [2018-06-26 20:33:12,597 INFO ]: TraceAbstraction took 45918.44 ms. Allocated memory was 366.5 MB in the beginning and 1.3 GB in the end (delta: 924.3 MB). Free memory was 272.2 MB in the beginning and 429.4 MB in the end (delta: -157.3 MB). Peak memory consumption was 767.1 MB. Max. memory is 3.6 GB. [2018-06-26 20:33:12,600 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.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 90.51 ms. Allocated memory is still 309.3 MB. Free memory was 197.8 MB in the beginning and 191.8 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 91.38 ms. Allocated memory was 309.3 MB in the beginning and 321.4 MB in the end (delta: 12.1 MB). Free memory was 191.8 MB in the beginning and 291.7 MB in the end (delta: -99.9 MB). Peak memory consumption was 6.8 MB. Max. memory is 3.6 GB. * RCFGBuilder took 723.12 ms. Allocated memory is still 321.4 MB. Free memory was 291.7 MB in the beginning and 219.9 MB in the end (delta: 71.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 553.16 ms. Allocated memory was 321.4 MB in the beginning and 366.5 MB in the end (delta: 45.1 MB). Free memory was 219.9 MB in the beginning and 272.2 MB in the end (delta: -52.3 MB). Peak memory consumption was 52.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 45918.44 ms. Allocated memory was 366.5 MB in the beginning and 1.3 GB in the end (delta: 924.3 MB). Free memory was 272.2 MB in the beginning and 429.4 MB in the end (delta: -157.3 MB). Peak memory consumption was 767.1 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, 45.8s OverallTime, 37 OverallIterations, 3 TraceHistogramMax, 27.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 177 SDtfs, 5 SDslu, 241 SDs, 0 SdLazy, 10729 SolverSat, 3009 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 453 SyntacticMatches, 17 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 5.1s 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: 2.9s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 7.5s 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-26_20-33-12-611.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-26_20-33-12-611.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-26_20-33-12-611.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-26_20-33-12-611.csv Received shutdown request...