java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:31:54,210 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:31:54,212 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:31:54,231 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:31:54,231 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:31:54,232 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:31:54,233 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:31:54,238 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:31:54,242 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:31:54,243 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:31:54,244 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:31:54,244 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:31:54,255 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:31:54,256 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:31:54,257 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:31:54,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:31:54,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:31:54,262 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:31:54,263 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:31:54,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:31:54,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:31:54,272 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:31:54,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:31:54,273 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:31:54,274 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:31:54,275 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:31:54,275 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:31:54,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:31:54,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:31:54,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:31:54,278 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:31:54,279 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:31:54,279 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:31:54,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:31:54,280 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:31:54,280 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:31:54,304 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:31:54,307 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:31:54,307 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:31:54,307 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:31:54,308 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:31:54,309 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:31:54,309 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:31:54,309 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:31:54,309 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:31:54,309 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:31:54,310 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:31:54,310 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:31:54,310 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:31:54,311 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:31:54,311 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:31:54,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:31:54,311 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:31:54,312 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:31:54,312 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:31:54,354 INFO ]: Repository-Root is: /tmp [2018-06-22 02:31:54,367 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:31:54,373 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:31:54,374 INFO ]: Initializing SmtParser... [2018-06-22 02:31:54,375 INFO ]: SmtParser initialized [2018-06-22 02:31:54,375 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 [2018-06-22 02:31:54,377 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-22 02:31:54,464 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@12196fde [2018-06-22 02:31:54,841 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 [2018-06-22 02:31:54,853 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:31:54,864 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:31:54,865 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:31:54,865 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:31:54,865 INFO ]: ChcToBoogie initialized [2018-06-22 02:31:54,868 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:31:54" (1/1) ... [2018-06-22 02:31:54,957 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:54 Unit [2018-06-22 02:31:54,957 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:31:54,958 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:31:54,958 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:31:54,958 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:31:54,975 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:54" (1/1) ... [2018-06-22 02:31:54,975 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:54" (1/1) ... [2018-06-22 02:31:54,980 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:54" (1/1) ... [2018-06-22 02:31:54,981 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:54" (1/1) ... [2018-06-22 02:31:54,992 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:54" (1/1) ... [2018-06-22 02:31:54,995 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:54" (1/1) ... [2018-06-22 02:31:54,997 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:54" (1/1) ... [2018-06-22 02:31:55,000 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:31:55,000 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:31:55,000 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:31:55,000 INFO ]: RCFGBuilder initialized [2018-06-22 02:31:55,001 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:54" (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-22 02:31:55,010 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:31:55,011 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:31:55,011 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:31:55,011 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:31:55,011 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:31:55,011 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 02:31:55,669 INFO ]: Using library mode [2018-06-22 02:31:55,670 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:31:55 BoogieIcfgContainer [2018-06-22 02:31:55,670 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:31:55,671 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:31:55,671 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:31:55,676 INFO ]: TraceAbstraction initialized [2018-06-22 02:31:55,676 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:31:54" (1/3) ... [2018-06-22 02:31:55,677 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c78c6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:31:55, skipping insertion in model container [2018-06-22 02:31:55,677 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:31:54" (2/3) ... [2018-06-22 02:31:55,677 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c78c6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:31:55, skipping insertion in model container [2018-06-22 02:31:55,677 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:31:55" (3/3) ... [2018-06-22 02:31:55,681 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:31:55,689 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:31:55,695 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:31:55,730 INFO ]: Using default assertion order modulation [2018-06-22 02:31:55,731 INFO ]: Interprodecural is true [2018-06-22 02:31:55,731 INFO ]: Hoare is false [2018-06-22 02:31:55,731 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:31:55,731 INFO ]: Backedges is TWOTRACK [2018-06-22 02:31:55,731 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:31:55,731 INFO ]: Difference is false [2018-06-22 02:31:55,731 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:31:55,731 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:31:55,756 INFO ]: Start isEmpty. Operand 58 states. [2018-06-22 02:31:55,768 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 02:31:55,768 INFO ]: Found error trace [2018-06-22 02:31:55,769 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:55,769 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:55,773 INFO ]: Analyzing trace with hash -1672879906, now seen corresponding path program 1 times [2018-06-22 02:31:55,774 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:55,774 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:55,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:55,811 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:55,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:55,846 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:55,941 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:31:55,943 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:55,943 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:31:55,945 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:31:55,957 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:31:55,958 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:31:55,961 INFO ]: Start difference. First operand 58 states. Second operand 4 states. [2018-06-22 02:31:56,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:56,997 INFO ]: Finished difference Result 101 states and 172 transitions. [2018-06-22 02:31:56,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:31:56,998 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-22 02:31:56,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:57,014 INFO ]: With dead ends: 101 [2018-06-22 02:31:57,014 INFO ]: Without dead ends: 87 [2018-06-22 02:31:57,016 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:31:57,035 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 02:31:57,085 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-06-22 02:31:57,088 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 02:31:57,093 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 148 transitions. [2018-06-22 02:31:57,095 INFO ]: Start accepts. Automaton has 87 states and 148 transitions. Word has length 10 [2018-06-22 02:31:57,095 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:57,095 INFO ]: Abstraction has 87 states and 148 transitions. [2018-06-22 02:31:57,095 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:31:57,095 INFO ]: Start isEmpty. Operand 87 states and 148 transitions. [2018-06-22 02:31:57,102 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:31:57,102 INFO ]: Found error trace [2018-06-22 02:31:57,102 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:57,102 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:57,102 INFO ]: Analyzing trace with hash -1833282538, now seen corresponding path program 1 times [2018-06-22 02:31:57,102 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:57,102 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:57,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:57,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:57,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:57,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:57,162 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:31:57,162 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:57,162 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:31:57,164 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:31:57,164 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:31:57,164 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:31:57,164 INFO ]: Start difference. First operand 87 states and 148 transitions. Second operand 4 states. [2018-06-22 02:31:57,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:57,517 INFO ]: Finished difference Result 125 states and 214 transitions. [2018-06-22 02:31:57,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:31:57,518 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 02:31:57,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:57,523 INFO ]: With dead ends: 125 [2018-06-22 02:31:57,523 INFO ]: Without dead ends: 125 [2018-06-22 02:31:57,524 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:31:57,524 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-22 02:31:57,540 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-06-22 02:31:57,540 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-22 02:31:57,544 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 214 transitions. [2018-06-22 02:31:57,544 INFO ]: Start accepts. Automaton has 125 states and 214 transitions. Word has length 11 [2018-06-22 02:31:57,544 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:57,544 INFO ]: Abstraction has 125 states and 214 transitions. [2018-06-22 02:31:57,544 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:31:57,544 INFO ]: Start isEmpty. Operand 125 states and 214 transitions. [2018-06-22 02:31:57,547 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 02:31:57,547 INFO ]: Found error trace [2018-06-22 02:31:57,547 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:57,547 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:57,548 INFO ]: Analyzing trace with hash 784067119, now seen corresponding path program 1 times [2018-06-22 02:31:57,548 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:57,548 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:57,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:57,548 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:57,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:57,556 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:57,604 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:31:57,604 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:57,604 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:31:57,605 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:31:57,605 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:31:57,605 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:31:57,605 INFO ]: Start difference. First operand 125 states and 214 transitions. Second operand 4 states. [2018-06-22 02:31:58,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:58,109 INFO ]: Finished difference Result 163 states and 280 transitions. [2018-06-22 02:31:58,110 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:31:58,110 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 02:31:58,110 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:58,115 INFO ]: With dead ends: 163 [2018-06-22 02:31:58,115 INFO ]: Without dead ends: 163 [2018-06-22 02:31:58,115 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:31:58,116 INFO ]: Start minimizeSevpa. Operand 163 states. [2018-06-22 02:31:58,134 INFO ]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-06-22 02:31:58,135 INFO ]: Start removeUnreachable. Operand 163 states. [2018-06-22 02:31:58,138 INFO ]: Finished removeUnreachable. Reduced from 163 states to 163 states and 280 transitions. [2018-06-22 02:31:58,138 INFO ]: Start accepts. Automaton has 163 states and 280 transitions. Word has length 13 [2018-06-22 02:31:58,138 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:58,138 INFO ]: Abstraction has 163 states and 280 transitions. [2018-06-22 02:31:58,139 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:31:58,139 INFO ]: Start isEmpty. Operand 163 states and 280 transitions. [2018-06-22 02:31:58,142 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:31:58,142 INFO ]: Found error trace [2018-06-22 02:31:58,143 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:58,143 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:58,143 INFO ]: Analyzing trace with hash -1247859227, now seen corresponding path program 1 times [2018-06-22 02:31:58,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:58,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:58,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:58,144 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:58,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:58,163 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:58,199 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:31:58,199 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:58,199 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:31:58,199 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:31:58,200 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:31:58,200 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:31:58,200 INFO ]: Start difference. First operand 163 states and 280 transitions. Second operand 4 states. [2018-06-22 02:31:58,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:58,411 INFO ]: Finished difference Result 196 states and 338 transitions. [2018-06-22 02:31:58,411 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:31:58,411 INFO ]: Start accepts. Automaton has 4 states. Word has length 16 [2018-06-22 02:31:58,411 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:58,416 INFO ]: With dead ends: 196 [2018-06-22 02:31:58,416 INFO ]: Without dead ends: 196 [2018-06-22 02:31:58,416 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:31:58,417 INFO ]: Start minimizeSevpa. Operand 196 states. [2018-06-22 02:31:58,436 INFO ]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-06-22 02:31:58,436 INFO ]: Start removeUnreachable. Operand 196 states. [2018-06-22 02:31:58,440 INFO ]: Finished removeUnreachable. Reduced from 196 states to 196 states and 338 transitions. [2018-06-22 02:31:58,440 INFO ]: Start accepts. Automaton has 196 states and 338 transitions. Word has length 16 [2018-06-22 02:31:58,440 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:58,440 INFO ]: Abstraction has 196 states and 338 transitions. [2018-06-22 02:31:58,440 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:31:58,440 INFO ]: Start isEmpty. Operand 196 states and 338 transitions. [2018-06-22 02:31:58,442 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:31:58,443 INFO ]: Found error trace [2018-06-22 02:31:58,443 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:58,443 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:58,443 INFO ]: Analyzing trace with hash 455113497, now seen corresponding path program 1 times [2018-06-22 02:31:58,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:58,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:58,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:58,444 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:58,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:58,454 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:58,530 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:31:58,530 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:58,530 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:31:58,531 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:31:58,531 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:31:58,531 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:31:58,531 INFO ]: Start difference. First operand 196 states and 338 transitions. Second operand 4 states. [2018-06-22 02:31:58,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:58,657 INFO ]: Finished difference Result 226 states and 425 transitions. [2018-06-22 02:31:58,659 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:31:58,659 INFO ]: Start accepts. Automaton has 4 states. Word has length 16 [2018-06-22 02:31:58,659 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:58,683 INFO ]: With dead ends: 226 [2018-06-22 02:31:58,683 INFO ]: Without dead ends: 226 [2018-06-22 02:31:58,683 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:31:58,684 INFO ]: Start minimizeSevpa. Operand 226 states. [2018-06-22 02:31:58,706 INFO ]: Finished minimizeSevpa. Reduced states from 226 to 206. [2018-06-22 02:31:58,706 INFO ]: Start removeUnreachable. Operand 206 states. [2018-06-22 02:31:58,711 INFO ]: Finished removeUnreachable. Reduced from 206 states to 206 states and 353 transitions. [2018-06-22 02:31:58,711 INFO ]: Start accepts. Automaton has 206 states and 353 transitions. Word has length 16 [2018-06-22 02:31:58,712 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:58,712 INFO ]: Abstraction has 206 states and 353 transitions. [2018-06-22 02:31:58,712 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:31:58,712 INFO ]: Start isEmpty. Operand 206 states and 353 transitions. [2018-06-22 02:31:58,714 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 02:31:58,714 INFO ]: Found error trace [2018-06-22 02:31:58,714 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:58,714 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:58,715 INFO ]: Analyzing trace with hash -690052543, now seen corresponding path program 1 times [2018-06-22 02:31:58,715 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:58,715 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:58,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:58,715 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:58,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:58,723 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:58,856 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:31:58,856 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:58,856 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:31:58,856 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:31:58,857 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:31:58,857 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:31:58,857 INFO ]: Start difference. First operand 206 states and 353 transitions. Second operand 4 states. [2018-06-22 02:31:59,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:59,047 INFO ]: Finished difference Result 242 states and 447 transitions. [2018-06-22 02:31:59,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:31:59,052 INFO ]: Start accepts. Automaton has 4 states. Word has length 16 [2018-06-22 02:31:59,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:59,057 INFO ]: With dead ends: 242 [2018-06-22 02:31:59,057 INFO ]: Without dead ends: 242 [2018-06-22 02:31:59,058 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:31:59,058 INFO ]: Start minimizeSevpa. Operand 242 states. [2018-06-22 02:31:59,099 INFO ]: Finished minimizeSevpa. Reduced states from 242 to 202. [2018-06-22 02:31:59,099 INFO ]: Start removeUnreachable. Operand 202 states. [2018-06-22 02:31:59,103 INFO ]: Finished removeUnreachable. Reduced from 202 states to 202 states and 345 transitions. [2018-06-22 02:31:59,103 INFO ]: Start accepts. Automaton has 202 states and 345 transitions. Word has length 16 [2018-06-22 02:31:59,103 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:59,103 INFO ]: Abstraction has 202 states and 345 transitions. [2018-06-22 02:31:59,103 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:31:59,103 INFO ]: Start isEmpty. Operand 202 states and 345 transitions. [2018-06-22 02:31:59,107 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:31:59,107 INFO ]: Found error trace [2018-06-22 02:31:59,107 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:59,107 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:59,107 INFO ]: Analyzing trace with hash 1223704183, now seen corresponding path program 1 times [2018-06-22 02:31:59,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:59,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:59,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:59,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:59,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:59,118 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:59,349 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:31:59,350 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:59,350 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:31:59,350 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:31:59,350 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:31:59,350 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:31:59,350 INFO ]: Start difference. First operand 202 states and 345 transitions. Second operand 5 states. [2018-06-22 02:31:59,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:59,428 INFO ]: Finished difference Result 226 states and 386 transitions. [2018-06-22 02:31:59,429 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:31:59,429 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 02:31:59,429 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:59,433 INFO ]: With dead ends: 226 [2018-06-22 02:31:59,433 INFO ]: Without dead ends: 216 [2018-06-22 02:31:59,433 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:31:59,434 INFO ]: Start minimizeSevpa. Operand 216 states. [2018-06-22 02:31:59,446 INFO ]: Finished minimizeSevpa. Reduced states from 216 to 209. [2018-06-22 02:31:59,447 INFO ]: Start removeUnreachable. Operand 209 states. [2018-06-22 02:31:59,449 INFO ]: Finished removeUnreachable. Reduced from 209 states to 209 states and 353 transitions. [2018-06-22 02:31:59,449 INFO ]: Start accepts. Automaton has 209 states and 353 transitions. Word has length 17 [2018-06-22 02:31:59,449 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:59,449 INFO ]: Abstraction has 209 states and 353 transitions. [2018-06-22 02:31:59,450 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:31:59,450 INFO ]: Start isEmpty. Operand 209 states and 353 transitions. [2018-06-22 02:31:59,452 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 02:31:59,452 INFO ]: Found error trace [2018-06-22 02:31:59,452 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:59,452 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:59,453 INFO ]: Analyzing trace with hash 83295311, now seen corresponding path program 1 times [2018-06-22 02:31:59,453 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:59,453 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:59,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:59,453 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:59,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:59,462 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:59,588 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:31:59,588 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:59,588 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:31:59,588 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:31:59,588 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:31:59,588 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:31:59,588 INFO ]: Start difference. First operand 209 states and 353 transitions. Second operand 5 states. [2018-06-22 02:31:59,647 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:59,647 INFO ]: Finished difference Result 231 states and 390 transitions. [2018-06-22 02:31:59,647 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:31:59,647 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 02:31:59,647 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:59,651 INFO ]: With dead ends: 231 [2018-06-22 02:31:59,651 INFO ]: Without dead ends: 221 [2018-06-22 02:31:59,651 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:31:59,651 INFO ]: Start minimizeSevpa. Operand 221 states. [2018-06-22 02:31:59,663 INFO ]: Finished minimizeSevpa. Reduced states from 221 to 209. [2018-06-22 02:31:59,663 INFO ]: Start removeUnreachable. Operand 209 states. [2018-06-22 02:31:59,665 INFO ]: Finished removeUnreachable. Reduced from 209 states to 209 states and 353 transitions. [2018-06-22 02:31:59,666 INFO ]: Start accepts. Automaton has 209 states and 353 transitions. Word has length 17 [2018-06-22 02:31:59,666 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:59,666 INFO ]: Abstraction has 209 states and 353 transitions. [2018-06-22 02:31:59,666 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:31:59,666 INFO ]: Start isEmpty. Operand 209 states and 353 transitions. [2018-06-22 02:31:59,670 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 02:31:59,670 INFO ]: Found error trace [2018-06-22 02:31:59,670 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:59,670 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:59,670 INFO ]: Analyzing trace with hash -1259626214, now seen corresponding path program 1 times [2018-06-22 02:31:59,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:59,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:59,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:59,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:59,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:59,680 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:59,888 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:31:59,888 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:31:59,888 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:31:59,888 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:31:59,888 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:31:59,888 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:31:59,889 INFO ]: Start difference. First operand 209 states and 353 transitions. Second operand 4 states. [2018-06-22 02:31:59,965 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:59,966 INFO ]: Finished difference Result 239 states and 435 transitions. [2018-06-22 02:31:59,977 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:31:59,977 INFO ]: Start accepts. Automaton has 4 states. Word has length 19 [2018-06-22 02:31:59,977 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:59,989 INFO ]: With dead ends: 239 [2018-06-22 02:31:59,989 INFO ]: Without dead ends: 239 [2018-06-22 02:31:59,990 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:31:59,990 INFO ]: Start minimizeSevpa. Operand 239 states. [2018-06-22 02:32:00,015 INFO ]: Finished minimizeSevpa. Reduced states from 239 to 219. [2018-06-22 02:32:00,015 INFO ]: Start removeUnreachable. Operand 219 states. [2018-06-22 02:32:00,018 INFO ]: Finished removeUnreachable. Reduced from 219 states to 219 states and 363 transitions. [2018-06-22 02:32:00,018 INFO ]: Start accepts. Automaton has 219 states and 363 transitions. Word has length 19 [2018-06-22 02:32:00,018 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:00,018 INFO ]: Abstraction has 219 states and 363 transitions. [2018-06-22 02:32:00,018 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:32:00,018 INFO ]: Start isEmpty. Operand 219 states and 363 transitions. [2018-06-22 02:32:00,024 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 02:32:00,024 INFO ]: Found error trace [2018-06-22 02:32:00,024 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:00,024 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:00,025 INFO ]: Analyzing trace with hash -1975891726, now seen corresponding path program 1 times [2018-06-22 02:32:00,025 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:00,025 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:00,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:00,025 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:00,026 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:00,043 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:00,088 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:32:00,088 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:00,088 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:32:00,088 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:32:00,088 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:32:00,088 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:32:00,089 INFO ]: Start difference. First operand 219 states and 363 transitions. Second operand 4 states. [2018-06-22 02:32:00,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:00,124 INFO ]: Finished difference Result 249 states and 445 transitions. [2018-06-22 02:32:00,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:32:00,130 INFO ]: Start accepts. Automaton has 4 states. Word has length 19 [2018-06-22 02:32:00,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:00,134 INFO ]: With dead ends: 249 [2018-06-22 02:32:00,134 INFO ]: Without dead ends: 249 [2018-06-22 02:32:00,134 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:32:00,134 INFO ]: Start minimizeSevpa. Operand 249 states. [2018-06-22 02:32:00,154 INFO ]: Finished minimizeSevpa. Reduced states from 249 to 214. [2018-06-22 02:32:00,154 INFO ]: Start removeUnreachable. Operand 214 states. [2018-06-22 02:32:00,157 INFO ]: Finished removeUnreachable. Reduced from 214 states to 214 states and 358 transitions. [2018-06-22 02:32:00,157 INFO ]: Start accepts. Automaton has 214 states and 358 transitions. Word has length 19 [2018-06-22 02:32:00,157 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:00,157 INFO ]: Abstraction has 214 states and 358 transitions. [2018-06-22 02:32:00,157 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:32:00,157 INFO ]: Start isEmpty. Operand 214 states and 358 transitions. [2018-06-22 02:32:00,161 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:32:00,161 INFO ]: Found error trace [2018-06-22 02:32:00,161 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:00,161 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:00,161 INFO ]: Analyzing trace with hash 2036290653, now seen corresponding path program 1 times [2018-06-22 02:32:00,161 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:00,161 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:00,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:00,162 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:00,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:00,173 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:00,318 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:32:00,318 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:00,318 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-22 02:32:00,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:00,354 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:00,361 INFO ]: Computing forward predicates... [2018-06-22 02:32:00,417 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:32:00,439 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:00,439 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-06-22 02:32:00,439 INFO ]: Interpolant automaton has 9 states [2018-06-22 02:32:00,439 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 02:32:00,439 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:32:00,439 INFO ]: Start difference. First operand 214 states and 358 transitions. Second operand 9 states. [2018-06-22 02:32:00,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:00,825 INFO ]: Finished difference Result 282 states and 501 transitions. [2018-06-22 02:32:00,826 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:32:00,826 INFO ]: Start accepts. Automaton has 9 states. Word has length 20 [2018-06-22 02:32:00,826 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:00,835 INFO ]: With dead ends: 282 [2018-06-22 02:32:00,835 INFO ]: Without dead ends: 267 [2018-06-22 02:32:00,837 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:32:00,837 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-22 02:32:00,863 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 230. [2018-06-22 02:32:00,863 INFO ]: Start removeUnreachable. Operand 230 states. [2018-06-22 02:32:00,868 INFO ]: Finished removeUnreachable. Reduced from 230 states to 230 states and 379 transitions. [2018-06-22 02:32:00,868 INFO ]: Start accepts. Automaton has 230 states and 379 transitions. Word has length 20 [2018-06-22 02:32:00,868 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:00,868 INFO ]: Abstraction has 230 states and 379 transitions. [2018-06-22 02:32:00,868 INFO ]: Interpolant automaton has 9 states. [2018-06-22 02:32:00,868 INFO ]: Start isEmpty. Operand 230 states and 379 transitions. [2018-06-22 02:32:00,876 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 02:32:00,876 INFO ]: Found error trace [2018-06-22 02:32:00,876 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:00,876 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:00,876 INFO ]: Analyzing trace with hash 1859166091, now seen corresponding path program 1 times [2018-06-22 02:32:00,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:00,876 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:00,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:00,877 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:00,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:00,899 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:01,153 INFO ]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:32:01,153 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:01,154 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:32:01,154 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:32:01,154 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:32:01,154 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:32:01,154 INFO ]: Start difference. First operand 230 states and 379 transitions. Second operand 5 states. [2018-06-22 02:32:01,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:01,660 INFO ]: Finished difference Result 257 states and 458 transitions. [2018-06-22 02:32:01,661 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:32:01,661 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 02:32:01,661 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:01,673 INFO ]: With dead ends: 257 [2018-06-22 02:32:01,673 INFO ]: Without dead ends: 242 [2018-06-22 02:32:01,673 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:32:01,673 INFO ]: Start minimizeSevpa. Operand 242 states. [2018-06-22 02:32:01,696 INFO ]: Finished minimizeSevpa. Reduced states from 242 to 225. [2018-06-22 02:32:01,696 INFO ]: Start removeUnreachable. Operand 225 states. [2018-06-22 02:32:01,699 INFO ]: Finished removeUnreachable. Reduced from 225 states to 225 states and 369 transitions. [2018-06-22 02:32:01,699 INFO ]: Start accepts. Automaton has 225 states and 369 transitions. Word has length 21 [2018-06-22 02:32:01,699 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:01,699 INFO ]: Abstraction has 225 states and 369 transitions. [2018-06-22 02:32:01,699 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:32:01,699 INFO ]: Start isEmpty. Operand 225 states and 369 transitions. [2018-06-22 02:32:01,706 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 02:32:01,706 INFO ]: Found error trace [2018-06-22 02:32:01,706 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:01,706 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:01,708 INFO ]: Analyzing trace with hash -912207134, now seen corresponding path program 1 times [2018-06-22 02:32:01,708 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:01,708 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:01,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:01,709 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:01,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:01,727 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:01,852 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:32:01,852 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:01,852 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 02:32:01,852 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:32:01,853 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:32:01,853 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:32:01,853 INFO ]: Start difference. First operand 225 states and 369 transitions. Second operand 7 states. [2018-06-22 02:32:02,502 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:02,503 INFO ]: Finished difference Result 284 states and 475 transitions. [2018-06-22 02:32:02,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:32:02,503 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 02:32:02,503 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:02,505 INFO ]: With dead ends: 284 [2018-06-22 02:32:02,505 INFO ]: Without dead ends: 251 [2018-06-22 02:32:02,506 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:32:02,506 INFO ]: Start minimizeSevpa. Operand 251 states. [2018-06-22 02:32:02,519 INFO ]: Finished minimizeSevpa. Reduced states from 251 to 230. [2018-06-22 02:32:02,519 INFO ]: Start removeUnreachable. Operand 230 states. [2018-06-22 02:32:02,521 INFO ]: Finished removeUnreachable. Reduced from 230 states to 230 states and 368 transitions. [2018-06-22 02:32:02,521 INFO ]: Start accepts. Automaton has 230 states and 368 transitions. Word has length 25 [2018-06-22 02:32:02,521 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:02,521 INFO ]: Abstraction has 230 states and 368 transitions. [2018-06-22 02:32:02,521 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:32:02,521 INFO ]: Start isEmpty. Operand 230 states and 368 transitions. [2018-06-22 02:32:02,524 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 02:32:02,524 INFO ]: Found error trace [2018-06-22 02:32:02,524 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] [2018-06-22 02:32:02,524 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:02,524 INFO ]: Analyzing trace with hash 275210654, now seen corresponding path program 1 times [2018-06-22 02:32:02,524 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:02,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:02,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:02,525 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:02,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:02,536 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:02,685 INFO ]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:32:02,685 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:02,685 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:32:02,685 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:32:02,686 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:32:02,686 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:32:02,686 INFO ]: Start difference. First operand 230 states and 368 transitions. Second operand 4 states. [2018-06-22 02:32:03,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:03,749 INFO ]: Finished difference Result 248 states and 396 transitions. [2018-06-22 02:32:03,749 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:32:03,749 INFO ]: Start accepts. Automaton has 4 states. Word has length 27 [2018-06-22 02:32:03,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:03,751 INFO ]: With dead ends: 248 [2018-06-22 02:32:03,751 INFO ]: Without dead ends: 225 [2018-06-22 02:32:03,751 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:32:03,752 INFO ]: Start minimizeSevpa. Operand 225 states. [2018-06-22 02:32:03,760 INFO ]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-06-22 02:32:03,760 INFO ]: Start removeUnreachable. Operand 225 states. [2018-06-22 02:32:03,765 INFO ]: Finished removeUnreachable. Reduced from 225 states to 225 states and 356 transitions. [2018-06-22 02:32:03,765 INFO ]: Start accepts. Automaton has 225 states and 356 transitions. Word has length 27 [2018-06-22 02:32:03,765 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:03,765 INFO ]: Abstraction has 225 states and 356 transitions. [2018-06-22 02:32:03,765 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:32:03,765 INFO ]: Start isEmpty. Operand 225 states and 356 transitions. [2018-06-22 02:32:03,768 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 02:32:03,768 INFO ]: Found error trace [2018-06-22 02:32:03,768 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] [2018-06-22 02:32:03,768 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:03,768 INFO ]: Analyzing trace with hash -1918281091, now seen corresponding path program 1 times [2018-06-22 02:32:03,768 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:03,768 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:03,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:03,769 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:03,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:03,786 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:04,163 INFO ]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:32:04,163 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:04,163 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 02:32:04,164 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:32:04,164 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:32:04,164 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:32:04,164 INFO ]: Start difference. First operand 225 states and 356 transitions. Second operand 7 states. [2018-06-22 02:32:04,574 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:04,574 INFO ]: Finished difference Result 253 states and 412 transitions. [2018-06-22 02:32:04,574 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:32:04,574 INFO ]: Start accepts. Automaton has 7 states. Word has length 28 [2018-06-22 02:32:04,575 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:04,578 INFO ]: With dead ends: 253 [2018-06-22 02:32:04,578 INFO ]: Without dead ends: 253 [2018-06-22 02:32:04,578 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:32:04,578 INFO ]: Start minimizeSevpa. Operand 253 states. [2018-06-22 02:32:04,588 INFO ]: Finished minimizeSevpa. Reduced states from 253 to 233. [2018-06-22 02:32:04,588 INFO ]: Start removeUnreachable. Operand 233 states. [2018-06-22 02:32:04,591 INFO ]: Finished removeUnreachable. Reduced from 233 states to 233 states and 368 transitions. [2018-06-22 02:32:04,591 INFO ]: Start accepts. Automaton has 233 states and 368 transitions. Word has length 28 [2018-06-22 02:32:04,592 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:04,592 INFO ]: Abstraction has 233 states and 368 transitions. [2018-06-22 02:32:04,592 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:32:04,592 INFO ]: Start isEmpty. Operand 233 states and 368 transitions. [2018-06-22 02:32:04,595 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 02:32:04,595 INFO ]: Found error trace [2018-06-22 02:32:04,595 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:04,595 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:04,595 INFO ]: Analyzing trace with hash -2134371433, now seen corresponding path program 1 times [2018-06-22 02:32:04,595 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:04,595 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:04,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:04,596 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:04,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:04,605 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:04,704 INFO ]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:32:04,704 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:04,704 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:32:04,704 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:32:04,704 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:32:04,704 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:32:04,704 INFO ]: Start difference. First operand 233 states and 368 transitions. Second operand 4 states. [2018-06-22 02:32:04,891 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:04,891 INFO ]: Finished difference Result 238 states and 373 transitions. [2018-06-22 02:32:04,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:32:04,892 INFO ]: Start accepts. Automaton has 4 states. Word has length 28 [2018-06-22 02:32:04,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:04,894 INFO ]: With dead ends: 238 [2018-06-22 02:32:04,894 INFO ]: Without dead ends: 223 [2018-06-22 02:32:04,895 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:32:04,895 INFO ]: Start minimizeSevpa. Operand 223 states. [2018-06-22 02:32:04,902 INFO ]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-06-22 02:32:04,902 INFO ]: Start removeUnreachable. Operand 223 states. [2018-06-22 02:32:04,904 INFO ]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2018-06-22 02:32:04,904 INFO ]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 28 [2018-06-22 02:32:04,904 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:04,904 INFO ]: Abstraction has 223 states and 343 transitions. [2018-06-22 02:32:04,904 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:32:04,904 INFO ]: Start isEmpty. Operand 223 states and 343 transitions. [2018-06-22 02:32:04,906 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 02:32:04,906 INFO ]: Found error trace [2018-06-22 02:32:04,906 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] [2018-06-22 02:32:04,906 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:04,907 INFO ]: Analyzing trace with hash -505731348, now seen corresponding path program 1 times [2018-06-22 02:32:04,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:04,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:04,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:04,907 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:04,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:04,922 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:05,502 INFO ]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:32:05,502 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:05,502 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:32:05,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:05,544 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:05,547 INFO ]: Computing forward predicates... [2018-06-22 02:32:06,004 INFO ]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:32:06,023 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:06,023 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 02:32:06,024 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:32:06,024 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:32:06,024 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:32:06,024 INFO ]: Start difference. First operand 223 states and 343 transitions. Second operand 13 states. [2018-06-22 02:32:06,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:06,700 INFO ]: Finished difference Result 293 states and 464 transitions. [2018-06-22 02:32:06,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 02:32:06,700 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 02:32:06,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:06,702 INFO ]: With dead ends: 293 [2018-06-22 02:32:06,702 INFO ]: Without dead ends: 244 [2018-06-22 02:32:06,703 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:32:06,703 INFO ]: Start minimizeSevpa. Operand 244 states. [2018-06-22 02:32:06,713 INFO ]: Finished minimizeSevpa. Reduced states from 244 to 229. [2018-06-22 02:32:06,713 INFO ]: Start removeUnreachable. Operand 229 states. [2018-06-22 02:32:06,715 INFO ]: Finished removeUnreachable. Reduced from 229 states to 229 states and 354 transitions. [2018-06-22 02:32:06,715 INFO ]: Start accepts. Automaton has 229 states and 354 transitions. Word has length 29 [2018-06-22 02:32:06,715 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:06,715 INFO ]: Abstraction has 229 states and 354 transitions. [2018-06-22 02:32:06,715 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:32:06,715 INFO ]: Start isEmpty. Operand 229 states and 354 transitions. [2018-06-22 02:32:06,717 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 02:32:06,717 INFO ]: Found error trace [2018-06-22 02:32:06,717 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] [2018-06-22 02:32:06,717 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:06,717 INFO ]: Analyzing trace with hash 798348266, now seen corresponding path program 2 times [2018-06-22 02:32:06,717 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:06,717 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:06,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:06,718 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:06,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:06,730 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:06,830 INFO ]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:32:06,830 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:06,830 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 02:32:06,830 INFO ]: Interpolant automaton has 11 states [2018-06-22 02:32:06,830 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 02:32:06,830 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:32:06,831 INFO ]: Start difference. First operand 229 states and 354 transitions. Second operand 11 states. [2018-06-22 02:32:07,119 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:07,119 INFO ]: Finished difference Result 293 states and 488 transitions. [2018-06-22 02:32:07,120 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 02:32:07,120 INFO ]: Start accepts. Automaton has 11 states. Word has length 30 [2018-06-22 02:32:07,120 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:07,122 INFO ]: With dead ends: 293 [2018-06-22 02:32:07,122 INFO ]: Without dead ends: 293 [2018-06-22 02:32:07,122 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:32:07,123 INFO ]: Start minimizeSevpa. Operand 293 states. [2018-06-22 02:32:07,134 INFO ]: Finished minimizeSevpa. Reduced states from 293 to 246. [2018-06-22 02:32:07,134 INFO ]: Start removeUnreachable. Operand 246 states. [2018-06-22 02:32:07,137 INFO ]: Finished removeUnreachable. Reduced from 246 states to 246 states and 385 transitions. [2018-06-22 02:32:07,137 INFO ]: Start accepts. Automaton has 246 states and 385 transitions. Word has length 30 [2018-06-22 02:32:07,137 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:07,137 INFO ]: Abstraction has 246 states and 385 transitions. [2018-06-22 02:32:07,137 INFO ]: Interpolant automaton has 11 states. [2018-06-22 02:32:07,137 INFO ]: Start isEmpty. Operand 246 states and 385 transitions. [2018-06-22 02:32:07,139 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 02:32:07,139 INFO ]: Found error trace [2018-06-22 02:32:07,139 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:07,139 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:07,139 INFO ]: Analyzing trace with hash 1482704579, now seen corresponding path program 1 times [2018-06-22 02:32:07,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:07,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:07,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:07,140 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:07,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:07,160 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:07,301 INFO ]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:32:07,301 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:07,301 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:32:07,302 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:32:07,302 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:32:07,302 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:32:07,302 INFO ]: Start difference. First operand 246 states and 385 transitions. Second operand 4 states. [2018-06-22 02:32:07,335 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:07,335 INFO ]: Finished difference Result 251 states and 390 transitions. [2018-06-22 02:32:07,335 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:32:07,335 INFO ]: Start accepts. Automaton has 4 states. Word has length 31 [2018-06-22 02:32:07,335 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:07,337 INFO ]: With dead ends: 251 [2018-06-22 02:32:07,337 INFO ]: Without dead ends: 236 [2018-06-22 02:32:07,337 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:32:07,337 INFO ]: Start minimizeSevpa. Operand 236 states. [2018-06-22 02:32:07,345 INFO ]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-06-22 02:32:07,345 INFO ]: Start removeUnreachable. Operand 236 states. [2018-06-22 02:32:07,350 INFO ]: Finished removeUnreachable. Reduced from 236 states to 236 states and 360 transitions. [2018-06-22 02:32:07,350 INFO ]: Start accepts. Automaton has 236 states and 360 transitions. Word has length 31 [2018-06-22 02:32:07,350 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:07,350 INFO ]: Abstraction has 236 states and 360 transitions. [2018-06-22 02:32:07,350 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:32:07,350 INFO ]: Start isEmpty. Operand 236 states and 360 transitions. [2018-06-22 02:32:07,356 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 02:32:07,356 INFO ]: Found error trace [2018-06-22 02:32:07,356 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:07,356 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:07,356 INFO ]: Analyzing trace with hash 1248209356, now seen corresponding path program 1 times [2018-06-22 02:32:07,356 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:07,356 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:07,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:07,357 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:07,357 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:07,366 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:07,472 INFO ]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:32:07,473 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:07,473 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:32:07,479 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:07,511 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:07,513 INFO ]: Computing forward predicates... [2018-06-22 02:32:07,598 INFO ]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:32:07,631 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:07,631 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-22 02:32:07,631 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:32:07,631 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:32:07,632 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:32:07,632 INFO ]: Start difference. First operand 236 states and 360 transitions. Second operand 12 states. [2018-06-22 02:32:08,731 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:08,731 INFO ]: Finished difference Result 412 states and 665 transitions. [2018-06-22 02:32:08,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 02:32:08,731 INFO ]: Start accepts. Automaton has 12 states. Word has length 32 [2018-06-22 02:32:08,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:08,734 INFO ]: With dead ends: 412 [2018-06-22 02:32:08,734 INFO ]: Without dead ends: 368 [2018-06-22 02:32:08,735 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 02:32:08,735 INFO ]: Start minimizeSevpa. Operand 368 states. [2018-06-22 02:32:08,755 INFO ]: Finished minimizeSevpa. Reduced states from 368 to 267. [2018-06-22 02:32:08,755 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-22 02:32:08,758 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 396 transitions. [2018-06-22 02:32:08,758 INFO ]: Start accepts. Automaton has 267 states and 396 transitions. Word has length 32 [2018-06-22 02:32:08,758 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:08,758 INFO ]: Abstraction has 267 states and 396 transitions. [2018-06-22 02:32:08,758 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:32:08,758 INFO ]: Start isEmpty. Operand 267 states and 396 transitions. [2018-06-22 02:32:08,760 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 02:32:08,760 INFO ]: Found error trace [2018-06-22 02:32:08,760 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:08,761 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:08,763 INFO ]: Analyzing trace with hash -490781972, now seen corresponding path program 2 times [2018-06-22 02:32:08,763 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:08,763 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:08,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:08,764 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:08,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:08,779 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:09,188 INFO ]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:32:09,188 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:09,188 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 02:32:09,188 INFO ]: Interpolant automaton has 8 states [2018-06-22 02:32:09,188 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 02:32:09,188 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:32:09,188 INFO ]: Start difference. First operand 267 states and 396 transitions. Second operand 8 states. [2018-06-22 02:32:09,315 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:09,315 INFO ]: Finished difference Result 367 states and 574 transitions. [2018-06-22 02:32:09,316 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 02:32:09,316 INFO ]: Start accepts. Automaton has 8 states. Word has length 34 [2018-06-22 02:32:09,316 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:09,319 INFO ]: With dead ends: 367 [2018-06-22 02:32:09,319 INFO ]: Without dead ends: 349 [2018-06-22 02:32:09,319 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:32:09,319 INFO ]: Start minimizeSevpa. Operand 349 states. [2018-06-22 02:32:09,330 INFO ]: Finished minimizeSevpa. Reduced states from 349 to 285. [2018-06-22 02:32:09,330 INFO ]: Start removeUnreachable. Operand 285 states. [2018-06-22 02:32:09,333 INFO ]: Finished removeUnreachable. Reduced from 285 states to 285 states and 420 transitions. [2018-06-22 02:32:09,333 INFO ]: Start accepts. Automaton has 285 states and 420 transitions. Word has length 34 [2018-06-22 02:32:09,333 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:09,333 INFO ]: Abstraction has 285 states and 420 transitions. [2018-06-22 02:32:09,333 INFO ]: Interpolant automaton has 8 states. [2018-06-22 02:32:09,333 INFO ]: Start isEmpty. Operand 285 states and 420 transitions. [2018-06-22 02:32:09,335 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 02:32:09,335 INFO ]: Found error trace [2018-06-22 02:32:09,335 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:09,335 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:09,335 INFO ]: Analyzing trace with hash -1704306197, now seen corresponding path program 1 times [2018-06-22 02:32:09,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:09,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:09,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:09,335 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:09,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:09,343 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:09,396 INFO ]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 02:32:09,396 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:09,396 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:32:09,396 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:32:09,396 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:32:09,396 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:32:09,396 INFO ]: Start difference. First operand 285 states and 420 transitions. Second operand 4 states. [2018-06-22 02:32:09,625 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:09,625 INFO ]: Finished difference Result 336 states and 499 transitions. [2018-06-22 02:32:09,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:32:09,628 INFO ]: Start accepts. Automaton has 4 states. Word has length 35 [2018-06-22 02:32:09,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:09,630 INFO ]: With dead ends: 336 [2018-06-22 02:32:09,630 INFO ]: Without dead ends: 324 [2018-06-22 02:32:09,631 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:32:09,631 INFO ]: Start minimizeSevpa. Operand 324 states. [2018-06-22 02:32:09,640 INFO ]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-06-22 02:32:09,640 INFO ]: Start removeUnreachable. Operand 324 states. [2018-06-22 02:32:09,642 INFO ]: Finished removeUnreachable. Reduced from 324 states to 324 states and 482 transitions. [2018-06-22 02:32:09,642 INFO ]: Start accepts. Automaton has 324 states and 482 transitions. Word has length 35 [2018-06-22 02:32:09,642 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:09,642 INFO ]: Abstraction has 324 states and 482 transitions. [2018-06-22 02:32:09,642 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:32:09,642 INFO ]: Start isEmpty. Operand 324 states and 482 transitions. [2018-06-22 02:32:09,644 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 02:32:09,644 INFO ]: Found error trace [2018-06-22 02:32:09,644 INFO ]: trace histogram [3, 3, 3, 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-22 02:32:09,644 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:09,645 INFO ]: Analyzing trace with hash 582691993, now seen corresponding path program 1 times [2018-06-22 02:32:09,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:09,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:09,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:09,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:09,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:09,651 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:09,785 INFO ]: Checked inductivity of 21 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:32:09,786 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:09,786 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 02:32:09,804 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:32:09,843 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:09,846 INFO ]: Computing forward predicates... [2018-06-22 02:32:09,851 INFO ]: Checked inductivity of 21 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:32:09,883 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:09,883 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 02:32:09,884 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:32:09,884 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:32:09,884 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:32:09,884 INFO ]: Start difference. First operand 324 states and 482 transitions. Second operand 4 states. [2018-06-22 02:32:11,071 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:11,072 INFO ]: Finished difference Result 338 states and 502 transitions. [2018-06-22 02:32:11,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:32:11,072 INFO ]: Start accepts. Automaton has 4 states. Word has length 37 [2018-06-22 02:32:11,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:11,073 INFO ]: With dead ends: 338 [2018-06-22 02:32:11,073 INFO ]: Without dead ends: 315 [2018-06-22 02:32:11,074 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:32:11,074 INFO ]: Start minimizeSevpa. Operand 315 states. [2018-06-22 02:32:11,084 INFO ]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-06-22 02:32:11,084 INFO ]: Start removeUnreachable. Operand 315 states. [2018-06-22 02:32:11,086 INFO ]: Finished removeUnreachable. Reduced from 315 states to 315 states and 462 transitions. [2018-06-22 02:32:11,086 INFO ]: Start accepts. Automaton has 315 states and 462 transitions. Word has length 37 [2018-06-22 02:32:11,087 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:11,087 INFO ]: Abstraction has 315 states and 462 transitions. [2018-06-22 02:32:11,087 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:32:11,087 INFO ]: Start isEmpty. Operand 315 states and 462 transitions. [2018-06-22 02:32:11,088 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 02:32:11,088 INFO ]: Found error trace [2018-06-22 02:32:11,088 INFO ]: trace histogram [4, 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] [2018-06-22 02:32:11,089 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:11,089 INFO ]: Analyzing trace with hash 620844224, now seen corresponding path program 1 times [2018-06-22 02:32:11,089 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:11,089 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:11,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:11,089 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:11,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:11,103 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:11,149 INFO ]: Checked inductivity of 30 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:32:11,149 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:11,149 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-22 02:32:11,155 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:11,204 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:11,207 INFO ]: Computing forward predicates... [2018-06-22 02:32:11,456 INFO ]: Checked inductivity of 30 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 02:32:11,476 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:11,476 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-06-22 02:32:11,476 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:32:11,477 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:32:11,477 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:32:11,477 INFO ]: Start difference. First operand 315 states and 462 transitions. Second operand 13 states. [2018-06-22 02:32:11,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:11,797 INFO ]: Finished difference Result 390 states and 616 transitions. [2018-06-22 02:32:11,798 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:32:11,798 INFO ]: Start accepts. Automaton has 13 states. Word has length 37 [2018-06-22 02:32:11,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:11,801 INFO ]: With dead ends: 390 [2018-06-22 02:32:11,801 INFO ]: Without dead ends: 390 [2018-06-22 02:32:11,802 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:32:11,802 INFO ]: Start minimizeSevpa. Operand 390 states. [2018-06-22 02:32:11,815 INFO ]: Finished minimizeSevpa. Reduced states from 390 to 339. [2018-06-22 02:32:11,815 INFO ]: Start removeUnreachable. Operand 339 states. [2018-06-22 02:32:11,819 INFO ]: Finished removeUnreachable. Reduced from 339 states to 339 states and 509 transitions. [2018-06-22 02:32:11,820 INFO ]: Start accepts. Automaton has 339 states and 509 transitions. Word has length 37 [2018-06-22 02:32:11,820 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:11,820 INFO ]: Abstraction has 339 states and 509 transitions. [2018-06-22 02:32:11,820 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:32:11,820 INFO ]: Start isEmpty. Operand 339 states and 509 transitions. [2018-06-22 02:32:11,827 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 02:32:11,827 INFO ]: Found error trace [2018-06-22 02:32:11,827 INFO ]: trace histogram [4, 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] [2018-06-22 02:32:11,827 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:11,827 INFO ]: Analyzing trace with hash -2079540695, now seen corresponding path program 1 times [2018-06-22 02:32:11,827 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:11,827 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:11,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:11,828 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:11,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:11,840 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:11,938 INFO ]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:32:11,938 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:11,938 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:32:11,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:11,970 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:11,972 INFO ]: Computing forward predicates... [2018-06-22 02:32:12,031 INFO ]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:32:12,057 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:12,057 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 02:32:12,057 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:32:12,057 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:32:12,057 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:32:12,057 INFO ]: Start difference. First operand 339 states and 509 transitions. Second operand 13 states. [2018-06-22 02:32:12,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:12,467 INFO ]: Finished difference Result 361 states and 549 transitions. [2018-06-22 02:32:12,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:32:12,467 INFO ]: Start accepts. Automaton has 13 states. Word has length 37 [2018-06-22 02:32:12,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:12,469 INFO ]: With dead ends: 361 [2018-06-22 02:32:12,469 INFO ]: Without dead ends: 361 [2018-06-22 02:32:12,469 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:32:12,469 INFO ]: Start minimizeSevpa. Operand 361 states. [2018-06-22 02:32:12,479 INFO ]: Finished minimizeSevpa. Reduced states from 361 to 350. [2018-06-22 02:32:12,480 INFO ]: Start removeUnreachable. Operand 350 states. [2018-06-22 02:32:12,482 INFO ]: Finished removeUnreachable. Reduced from 350 states to 350 states and 532 transitions. [2018-06-22 02:32:12,482 INFO ]: Start accepts. Automaton has 350 states and 532 transitions. Word has length 37 [2018-06-22 02:32:12,482 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:12,482 INFO ]: Abstraction has 350 states and 532 transitions. [2018-06-22 02:32:12,482 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:32:12,482 INFO ]: Start isEmpty. Operand 350 states and 532 transitions. [2018-06-22 02:32:12,485 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 02:32:12,485 INFO ]: Found error trace [2018-06-22 02:32:12,485 INFO ]: trace histogram [4, 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] [2018-06-22 02:32:12,485 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:12,485 INFO ]: Analyzing trace with hash -1104536824, now seen corresponding path program 2 times [2018-06-22 02:32:12,485 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:12,485 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:12,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:12,486 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:12,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:12,499 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:12,837 INFO ]: Checked inductivity of 34 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:32:12,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:12,837 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-22 02:32:12,844 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:32:12,875 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:32:12,875 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:12,878 INFO ]: Computing forward predicates... [2018-06-22 02:32:12,967 INFO ]: Checked inductivity of 34 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 02:32:12,987 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:12,987 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-22 02:32:12,987 INFO ]: Interpolant automaton has 15 states [2018-06-22 02:32:12,987 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 02:32:12,987 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:32:12,987 INFO ]: Start difference. First operand 350 states and 532 transitions. Second operand 15 states. [2018-06-22 02:32:13,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:13,724 INFO ]: Finished difference Result 547 states and 925 transitions. [2018-06-22 02:32:13,725 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 02:32:13,725 INFO ]: Start accepts. Automaton has 15 states. Word has length 38 [2018-06-22 02:32:13,725 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:13,730 INFO ]: With dead ends: 547 [2018-06-22 02:32:13,730 INFO ]: Without dead ends: 547 [2018-06-22 02:32:13,730 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 02:32:13,731 INFO ]: Start minimizeSevpa. Operand 547 states. [2018-06-22 02:32:13,747 INFO ]: Finished minimizeSevpa. Reduced states from 547 to 390. [2018-06-22 02:32:13,747 INFO ]: Start removeUnreachable. Operand 390 states. [2018-06-22 02:32:13,750 INFO ]: Finished removeUnreachable. Reduced from 390 states to 390 states and 596 transitions. [2018-06-22 02:32:13,750 INFO ]: Start accepts. Automaton has 390 states and 596 transitions. Word has length 38 [2018-06-22 02:32:13,750 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:13,750 INFO ]: Abstraction has 390 states and 596 transitions. [2018-06-22 02:32:13,750 INFO ]: Interpolant automaton has 15 states. [2018-06-22 02:32:13,750 INFO ]: Start isEmpty. Operand 390 states and 596 transitions. [2018-06-22 02:32:13,753 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 02:32:13,753 INFO ]: Found error trace [2018-06-22 02:32:13,753 INFO ]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:13,753 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:13,753 INFO ]: Analyzing trace with hash 79875414, now seen corresponding path program 2 times [2018-06-22 02:32:13,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:13,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:13,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:13,754 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:13,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:13,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:14,103 INFO ]: Checked inductivity of 45 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 02:32:14,103 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:14,103 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 02:32:14,103 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:32:14,103 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:32:14,103 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:32:14,103 INFO ]: Start difference. First operand 390 states and 596 transitions. Second operand 7 states. [2018-06-22 02:32:14,212 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:14,212 INFO ]: Finished difference Result 512 states and 812 transitions. [2018-06-22 02:32:14,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 02:32:14,213 INFO ]: Start accepts. Automaton has 7 states. Word has length 40 [2018-06-22 02:32:14,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:14,216 INFO ]: With dead ends: 512 [2018-06-22 02:32:14,216 INFO ]: Without dead ends: 512 [2018-06-22 02:32:14,216 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:32:14,217 INFO ]: Start minimizeSevpa. Operand 512 states. [2018-06-22 02:32:14,242 INFO ]: Finished minimizeSevpa. Reduced states from 512 to 414. [2018-06-22 02:32:14,243 INFO ]: Start removeUnreachable. Operand 414 states. [2018-06-22 02:32:14,245 INFO ]: Finished removeUnreachable. Reduced from 414 states to 414 states and 638 transitions. [2018-06-22 02:32:14,245 INFO ]: Start accepts. Automaton has 414 states and 638 transitions. Word has length 40 [2018-06-22 02:32:14,245 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:14,245 INFO ]: Abstraction has 414 states and 638 transitions. [2018-06-22 02:32:14,245 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:32:14,245 INFO ]: Start isEmpty. Operand 414 states and 638 transitions. [2018-06-22 02:32:14,249 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 02:32:14,249 INFO ]: Found error trace [2018-06-22 02:32:14,249 INFO ]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:14,249 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:14,249 INFO ]: Analyzing trace with hash 1391049077, now seen corresponding path program 3 times [2018-06-22 02:32:14,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:14,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:14,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:14,250 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:14,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:14,266 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:14,669 INFO ]: Checked inductivity of 45 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 02:32:14,669 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:14,669 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-22 02:32:14,681 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:32:14,734 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 02:32:14,734 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:14,737 INFO ]: Computing forward predicates... [2018-06-22 02:32:14,932 INFO ]: Checked inductivity of 45 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 02:32:14,952 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:32:14,953 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2018-06-22 02:32:14,953 INFO ]: Interpolant automaton has 12 states [2018-06-22 02:32:14,953 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 02:32:14,953 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:32:14,953 INFO ]: Start difference. First operand 414 states and 638 transitions. Second operand 12 states. [2018-06-22 02:32:15,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:15,540 INFO ]: Finished difference Result 627 states and 972 transitions. [2018-06-22 02:32:15,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 02:32:15,540 INFO ]: Start accepts. Automaton has 12 states. Word has length 40 [2018-06-22 02:32:15,540 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:15,543 INFO ]: With dead ends: 627 [2018-06-22 02:32:15,543 INFO ]: Without dead ends: 585 [2018-06-22 02:32:15,544 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:32:15,544 INFO ]: Start minimizeSevpa. Operand 585 states. [2018-06-22 02:32:15,558 INFO ]: Finished minimizeSevpa. Reduced states from 585 to 409. [2018-06-22 02:32:15,559 INFO ]: Start removeUnreachable. Operand 409 states. [2018-06-22 02:32:15,561 INFO ]: Finished removeUnreachable. Reduced from 409 states to 409 states and 608 transitions. [2018-06-22 02:32:15,561 INFO ]: Start accepts. Automaton has 409 states and 608 transitions. Word has length 40 [2018-06-22 02:32:15,561 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:15,561 INFO ]: Abstraction has 409 states and 608 transitions. [2018-06-22 02:32:15,561 INFO ]: Interpolant automaton has 12 states. [2018-06-22 02:32:15,561 INFO ]: Start isEmpty. Operand 409 states and 608 transitions. [2018-06-22 02:32:15,565 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 02:32:15,565 INFO ]: Found error trace [2018-06-22 02:32:15,565 INFO ]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:15,565 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:15,565 INFO ]: Analyzing trace with hash -1735135149, now seen corresponding path program 3 times [2018-06-22 02:32:15,565 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:15,565 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:15,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:15,566 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:15,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:15,603 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:16,157 INFO ]: Checked inductivity of 54 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 02:32:16,157 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:16,157 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:32:16,163 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:32:16,196 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 02:32:16,196 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:16,199 INFO ]: Computing forward predicates... [2018-06-22 02:32:16,724 INFO ]: Checked inductivity of 54 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 02:32:16,747 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:16,747 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 02:32:16,747 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:32:16,747 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:32:16,747 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:32:16,747 INFO ]: Start difference. First operand 409 states and 608 transitions. Second operand 13 states. [2018-06-22 02:32:17,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:17,589 INFO ]: Finished difference Result 441 states and 677 transitions. [2018-06-22 02:32:17,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 02:32:17,589 INFO ]: Start accepts. Automaton has 13 states. Word has length 42 [2018-06-22 02:32:17,589 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:17,592 INFO ]: With dead ends: 441 [2018-06-22 02:32:17,592 INFO ]: Without dead ends: 441 [2018-06-22 02:32:17,592 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:32:17,592 INFO ]: Start minimizeSevpa. Operand 441 states. [2018-06-22 02:32:17,604 INFO ]: Finished minimizeSevpa. Reduced states from 441 to 417. [2018-06-22 02:32:17,604 INFO ]: Start removeUnreachable. Operand 417 states. [2018-06-22 02:32:17,606 INFO ]: Finished removeUnreachable. Reduced from 417 states to 417 states and 619 transitions. [2018-06-22 02:32:17,606 INFO ]: Start accepts. Automaton has 417 states and 619 transitions. Word has length 42 [2018-06-22 02:32:17,606 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:17,606 INFO ]: Abstraction has 417 states and 619 transitions. [2018-06-22 02:32:17,606 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:32:17,606 INFO ]: Start isEmpty. Operand 417 states and 619 transitions. [2018-06-22 02:32:17,610 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 02:32:17,610 INFO ]: Found error trace [2018-06-22 02:32:17,610 INFO ]: trace histogram [6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:17,610 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:17,610 INFO ]: Analyzing trace with hash -155729556, now seen corresponding path program 4 times [2018-06-22 02:32:17,610 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:17,610 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:17,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:17,613 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:17,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:17,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:17,712 INFO ]: Checked inductivity of 68 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 02:32:17,712 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:17,712 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:32:17,718 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 02:32:17,772 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 02:32:17,772 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:17,776 INFO ]: Computing forward predicates... [2018-06-22 02:32:17,926 INFO ]: Checked inductivity of 68 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 02:32:17,949 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:17,949 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-22 02:32:17,949 INFO ]: Interpolant automaton has 15 states [2018-06-22 02:32:17,949 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 02:32:17,949 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:32:17,949 INFO ]: Start difference. First operand 417 states and 619 transitions. Second operand 15 states. [2018-06-22 02:32:18,256 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:18,256 INFO ]: Finished difference Result 477 states and 725 transitions. [2018-06-22 02:32:18,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 02:32:18,257 INFO ]: Start accepts. Automaton has 15 states. Word has length 44 [2018-06-22 02:32:18,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:18,259 INFO ]: With dead ends: 477 [2018-06-22 02:32:18,259 INFO ]: Without dead ends: 428 [2018-06-22 02:32:18,260 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2018-06-22 02:32:18,260 INFO ]: Start minimizeSevpa. Operand 428 states. [2018-06-22 02:32:18,274 INFO ]: Finished minimizeSevpa. Reduced states from 428 to 372. [2018-06-22 02:32:18,274 INFO ]: Start removeUnreachable. Operand 372 states. [2018-06-22 02:32:18,293 INFO ]: Finished removeUnreachable. Reduced from 372 states to 372 states and 549 transitions. [2018-06-22 02:32:18,293 INFO ]: Start accepts. Automaton has 372 states and 549 transitions. Word has length 44 [2018-06-22 02:32:18,293 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:18,293 INFO ]: Abstraction has 372 states and 549 transitions. [2018-06-22 02:32:18,293 INFO ]: Interpolant automaton has 15 states. [2018-06-22 02:32:18,293 INFO ]: Start isEmpty. Operand 372 states and 549 transitions. [2018-06-22 02:32:18,299 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 02:32:18,299 INFO ]: Found error trace [2018-06-22 02:32:18,299 INFO ]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:18,299 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:18,299 INFO ]: Analyzing trace with hash -562948281, now seen corresponding path program 1 times [2018-06-22 02:32:18,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:18,299 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:18,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:18,300 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:18,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:18,312 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:18,390 INFO ]: Checked inductivity of 48 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:32:18,390 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:18,390 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:32:18,391 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:32:18,391 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:32:18,391 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:32:18,391 INFO ]: Start difference. First operand 372 states and 549 transitions. Second operand 4 states. [2018-06-22 02:32:18,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:18,470 INFO ]: Finished difference Result 448 states and 653 transitions. [2018-06-22 02:32:18,471 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:32:18,471 INFO ]: Start accepts. Automaton has 4 states. Word has length 45 [2018-06-22 02:32:18,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:18,473 INFO ]: With dead ends: 448 [2018-06-22 02:32:18,473 INFO ]: Without dead ends: 372 [2018-06-22 02:32:18,473 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:32:18,473 INFO ]: Start minimizeSevpa. Operand 372 states. [2018-06-22 02:32:18,481 INFO ]: Finished minimizeSevpa. Reduced states from 372 to 372. [2018-06-22 02:32:18,481 INFO ]: Start removeUnreachable. Operand 372 states. [2018-06-22 02:32:18,483 INFO ]: Finished removeUnreachable. Reduced from 372 states to 372 states and 545 transitions. [2018-06-22 02:32:18,483 INFO ]: Start accepts. Automaton has 372 states and 545 transitions. Word has length 45 [2018-06-22 02:32:18,483 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:18,483 INFO ]: Abstraction has 372 states and 545 transitions. [2018-06-22 02:32:18,483 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:32:18,484 INFO ]: Start isEmpty. Operand 372 states and 545 transitions. [2018-06-22 02:32:18,486 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-22 02:32:18,486 INFO ]: Found error trace [2018-06-22 02:32:18,486 INFO ]: trace histogram [4, 4, 4, 3, 3, 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] [2018-06-22 02:32:18,486 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:18,486 INFO ]: Analyzing trace with hash 733417876, now seen corresponding path program 1 times [2018-06-22 02:32:18,486 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:18,486 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:18,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:18,487 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:18,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:18,496 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:18,693 INFO ]: Checked inductivity of 42 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 02:32:18,693 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:32:18,693 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:32:18,693 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:32:18,693 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:32:18,693 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:32:18,694 INFO ]: Start difference. First operand 372 states and 545 transitions. Second operand 5 states. [2018-06-22 02:32:18,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:18,746 INFO ]: Finished difference Result 451 states and 705 transitions. [2018-06-22 02:32:18,746 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:32:18,746 INFO ]: Start accepts. Automaton has 5 states. Word has length 47 [2018-06-22 02:32:18,746 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:18,750 INFO ]: With dead ends: 451 [2018-06-22 02:32:18,750 INFO ]: Without dead ends: 451 [2018-06-22 02:32:18,750 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 02:32:18,751 INFO ]: Start minimizeSevpa. Operand 451 states. [2018-06-22 02:32:18,763 INFO ]: Finished minimizeSevpa. Reduced states from 451 to 372. [2018-06-22 02:32:18,763 INFO ]: Start removeUnreachable. Operand 372 states. [2018-06-22 02:32:18,766 INFO ]: Finished removeUnreachable. Reduced from 372 states to 372 states and 545 transitions. [2018-06-22 02:32:18,766 INFO ]: Start accepts. Automaton has 372 states and 545 transitions. Word has length 47 [2018-06-22 02:32:18,766 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:18,766 INFO ]: Abstraction has 372 states and 545 transitions. [2018-06-22 02:32:18,766 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:32:18,766 INFO ]: Start isEmpty. Operand 372 states and 545 transitions. [2018-06-22 02:32:18,769 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-22 02:32:18,769 INFO ]: Found error trace [2018-06-22 02:32:18,769 INFO ]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:18,769 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:18,769 INFO ]: Analyzing trace with hash -914105304, now seen corresponding path program 2 times [2018-06-22 02:32:18,769 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:18,769 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:18,770 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:18,770 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:32:18,770 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:18,781 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:18,847 INFO ]: Checked inductivity of 47 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 02:32:18,848 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:18,848 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:32:18,854 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:32:18,887 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:32:18,887 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:18,889 INFO ]: Computing forward predicates... [2018-06-22 02:32:18,924 INFO ]: Checked inductivity of 47 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 02:32:18,951 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:18,951 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 02:32:18,952 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:32:18,952 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:32:18,952 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:32:18,952 INFO ]: Start difference. First operand 372 states and 545 transitions. Second operand 10 states. [2018-06-22 02:32:19,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:19,045 INFO ]: Finished difference Result 399 states and 583 transitions. [2018-06-22 02:32:19,045 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:32:19,045 INFO ]: Start accepts. Automaton has 10 states. Word has length 48 [2018-06-22 02:32:19,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:19,049 INFO ]: With dead ends: 399 [2018-06-22 02:32:19,049 INFO ]: Without dead ends: 399 [2018-06-22 02:32:19,049 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:32:19,050 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-22 02:32:19,059 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 392. [2018-06-22 02:32:19,059 INFO ]: Start removeUnreachable. Operand 392 states. [2018-06-22 02:32:19,061 INFO ]: Finished removeUnreachable. Reduced from 392 states to 392 states and 576 transitions. [2018-06-22 02:32:19,061 INFO ]: Start accepts. Automaton has 392 states and 576 transitions. Word has length 48 [2018-06-22 02:32:19,061 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:19,061 INFO ]: Abstraction has 392 states and 576 transitions. [2018-06-22 02:32:19,061 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:32:19,061 INFO ]: Start isEmpty. Operand 392 states and 576 transitions. [2018-06-22 02:32:19,064 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 02:32:19,064 INFO ]: Found error trace [2018-06-22 02:32:19,065 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 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-22 02:32:19,065 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:19,065 INFO ]: Analyzing trace with hash 1727594312, now seen corresponding path program 3 times [2018-06-22 02:32:19,065 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:19,065 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:19,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:19,065 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:19,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:19,078 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:19,528 INFO ]: Checked inductivity of 53 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 02:32:19,528 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:19,528 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:32:19,534 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:32:19,567 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 02:32:19,567 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:19,570 INFO ]: Computing forward predicates... [2018-06-22 02:32:19,629 INFO ]: Checked inductivity of 53 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 02:32:19,660 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:19,660 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2018-06-22 02:32:19,661 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:32:19,661 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:32:19,661 INFO ]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:32:19,661 INFO ]: Start difference. First operand 392 states and 576 transitions. Second operand 16 states. [2018-06-22 02:32:20,001 WARN ]: Spent 256.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-06-22 02:32:20,620 WARN ]: Spent 311.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-06-22 02:32:22,011 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:22,011 INFO ]: Finished difference Result 508 states and 773 transitions. [2018-06-22 02:32:22,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 02:32:22,017 INFO ]: Start accepts. Automaton has 16 states. Word has length 49 [2018-06-22 02:32:22,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:22,019 INFO ]: With dead ends: 508 [2018-06-22 02:32:22,019 INFO ]: Without dead ends: 451 [2018-06-22 02:32:22,020 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 02:32:22,020 INFO ]: Start minimizeSevpa. Operand 451 states. [2018-06-22 02:32:22,030 INFO ]: Finished minimizeSevpa. Reduced states from 451 to 392. [2018-06-22 02:32:22,030 INFO ]: Start removeUnreachable. Operand 392 states. [2018-06-22 02:32:22,031 INFO ]: Finished removeUnreachable. Reduced from 392 states to 392 states and 573 transitions. [2018-06-22 02:32:22,032 INFO ]: Start accepts. Automaton has 392 states and 573 transitions. Word has length 49 [2018-06-22 02:32:22,032 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:22,032 INFO ]: Abstraction has 392 states and 573 transitions. [2018-06-22 02:32:22,032 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:32:22,032 INFO ]: Start isEmpty. Operand 392 states and 573 transitions. [2018-06-22 02:32:22,034 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-22 02:32:22,034 INFO ]: Found error trace [2018-06-22 02:32:22,035 INFO ]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:32:22,035 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:32:22,035 INFO ]: Analyzing trace with hash -825058225, now seen corresponding path program 1 times [2018-06-22 02:32:22,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:32:22,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:32:22,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:22,035 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:32:22,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:32:22,051 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:22,266 INFO ]: Checked inductivity of 64 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 02:32:22,266 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:32:22,266 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 02:32:22,282 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:32:22,334 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:32:22,337 INFO ]: Computing forward predicates... [2018-06-22 02:32:22,421 INFO ]: Checked inductivity of 64 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 02:32:22,459 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:32:22,460 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2018-06-22 02:32:22,460 INFO ]: Interpolant automaton has 16 states [2018-06-22 02:32:22,460 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 02:32:22,460 INFO ]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-22 02:32:22,460 INFO ]: Start difference. First operand 392 states and 573 transitions. Second operand 16 states. [2018-06-22 02:32:24,424 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:32:24,425 INFO ]: Finished difference Result 360 states and 507 transitions. [2018-06-22 02:32:24,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 02:32:24,425 INFO ]: Start accepts. Automaton has 16 states. Word has length 52 [2018-06-22 02:32:24,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:32:24,425 INFO ]: With dead ends: 360 [2018-06-22 02:32:24,425 INFO ]: Without dead ends: 0 [2018-06-22 02:32:24,426 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=498, Invalid=2258, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 02:32:24,426 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 02:32:24,426 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 02:32:24,426 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 02:32:24,426 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 02:32:24,426 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-06-22 02:32:24,426 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:32:24,426 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 02:32:24,426 INFO ]: Interpolant automaton has 16 states. [2018-06-22 02:32:24,426 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 02:32:24,426 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 02:32:24,430 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:32:24 BoogieIcfgContainer [2018-06-22 02:32:24,430 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:32:24,431 INFO ]: Toolchain (without parser) took 29577.72 ms. Allocated memory was 308.8 MB in the beginning and 509.1 MB in the end (delta: 200.3 MB). Free memory was 258.2 MB in the beginning and 361.6 MB in the end (delta: -103.4 MB). Peak memory consumption was 96.9 MB. Max. memory is 3.6 GB. [2018-06-22 02:32:24,432 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:32:24,432 INFO ]: ChcToBoogie took 92.66 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 255.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:32:24,432 INFO ]: Boogie Preprocessor took 42.12 ms. Allocated memory is still 308.8 MB. Free memory was 255.2 MB in the beginning and 254.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 02:32:24,432 INFO ]: RCFGBuilder took 669.68 ms. Allocated memory is still 308.8 MB. Free memory was 254.2 MB in the beginning and 231.2 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:32:24,433 INFO ]: TraceAbstraction took 28758.94 ms. Allocated memory was 308.8 MB in the beginning and 509.1 MB in the end (delta: 200.3 MB). Free memory was 230.2 MB in the beginning and 361.6 MB in the end (delta: -131.4 MB). Peak memory consumption was 68.9 MB. Max. memory is 3.6 GB. [2018-06-22 02:32:24,438 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 92.66 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 255.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 42.12 ms. Allocated memory is still 308.8 MB. Free memory was 255.2 MB in the beginning and 254.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 669.68 ms. Allocated memory is still 308.8 MB. Free memory was 254.2 MB in the beginning and 231.2 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 28758.94 ms. Allocated memory was 308.8 MB in the beginning and 509.1 MB in the end (delta: 200.3 MB). Free memory was 230.2 MB in the beginning and 361.6 MB in the end (delta: -131.4 MB). Peak memory consumption was 68.9 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, 58 locations, 1 error locations. SAFE Result, 28.7s OverallTime, 35 OverallIterations, 6 TraceHistogramMax, 17.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2803 SDtfs, 2639 SDslu, 10313 SDs, 0 SdLazy, 6544 SolverSat, 1151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 973 GetRequests, 529 SyntacticMatches, 8 SemanticMatches, 436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2174 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=417occurred 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.6s AutomataMinimizationTime, 35 MinimizatonAttempts, 1174 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 1555 NumberOfCodeBlocks, 1542 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1507 ConstructedInterpolants, 0 QuantifiedInterpolants, 116545 SizeOfPredicates, 80 NumberOfNonLiveVariables, 3352 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 48 InterpolantComputations, 23 PerfectInterpolantSequences, 1117/1190 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/rec__rec_while.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-32-24-543.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__rec_while.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-32-24-543.csv Received shutdown request...