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_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/arrays/heap__selsort.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:43:01,158 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:43:01,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:43:01,177 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:43:01,177 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:43:01,178 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:43:01,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:43:01,187 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:43:01,189 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:43:01,190 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:43:01,190 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:43:01,191 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:43:01,194 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:43:01,195 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:43:01,195 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:43:01,196 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:43:01,199 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:43:01,201 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:43:01,214 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:43:01,215 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:43:01,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:43:01,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:43:01,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:43:01,218 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:43:01,219 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:43:01,220 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:43:01,221 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:43:01,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:43:01,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:43:01,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:43:01,225 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:43:01,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:43:01,226 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:43:01,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:43:01,227 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:43:01,227 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:43:01,243 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:43:01,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:43:01,244 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:43:01,244 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:43:01,245 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:43:01,245 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:43:01,246 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:43:01,246 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:43:01,246 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:43:01,246 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:43:01,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:43:01,247 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:43:01,247 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:43:01,247 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:43:01,247 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:43:01,247 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:43:01,248 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:43:01,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:43:01,248 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:43:01,249 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:43:01,250 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:43:01,289 INFO ]: Repository-Root is: /tmp [2018-06-22 11:43:01,306 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:43:01,311 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:43:01,313 INFO ]: Initializing SmtParser... [2018-06-22 11:43:01,313 INFO ]: SmtParser initialized [2018-06-22 11:43:01,314 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/heap__selsort.array.smt2 [2018-06-22 11:43:01,315 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 11:43:01,390 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/heap__selsort.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@2694730e [2018-06-22 11:43:01,667 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/heap__selsort.array.smt2 [2018-06-22 11:43:01,671 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:43:01,677 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:43:01,678 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:43:01,678 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:43:01,678 INFO ]: ChcToBoogie initialized [2018-06-22 11:43:01,681 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:43:01" (1/1) ... [2018-06-22 11:43:01,731 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:01 Unit [2018-06-22 11:43:01,731 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:43:01,732 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:43:01,732 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:43:01,732 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:43:01,753 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:01" (1/1) ... [2018-06-22 11:43:01,753 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:01" (1/1) ... [2018-06-22 11:43:01,768 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:01" (1/1) ... [2018-06-22 11:43:01,768 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:01" (1/1) ... [2018-06-22 11:43:01,783 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:01" (1/1) ... [2018-06-22 11:43:01,785 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:01" (1/1) ... [2018-06-22 11:43:01,787 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:01" (1/1) ... [2018-06-22 11:43:01,788 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:43:01,789 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:43:01,789 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:43:01,789 INFO ]: RCFGBuilder initialized [2018-06-22 11:43:01,798 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:01" (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 11:43:01,812 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:43:01,812 INFO ]: Found specification of procedure False [2018-06-22 11:43:01,812 INFO ]: Found implementation of procedure False [2018-06-22 11:43:01,812 INFO ]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration [2018-06-22 11:43:01,812 INFO ]: Found specification of procedure INV_MAIN_1 [2018-06-22 11:43:01,812 INFO ]: Found implementation of procedure INV_MAIN_1 [2018-06-22 11:43:01,812 INFO ]: Specification and implementation of procedure INV_MAIN_2 given in one single declaration [2018-06-22 11:43:01,812 INFO ]: Found specification of procedure INV_MAIN_2 [2018-06-22 11:43:01,812 INFO ]: Found implementation of procedure INV_MAIN_2 [2018-06-22 11:43:01,812 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:43:01,812 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:43:01,812 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:43:02,269 INFO ]: Using library mode [2018-06-22 11:43:02,269 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:43:02 BoogieIcfgContainer [2018-06-22 11:43:02,270 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:43:02,271 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:43:02,271 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:43:02,274 INFO ]: TraceAbstraction initialized [2018-06-22 11:43:02,274 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:43:01" (1/3) ... [2018-06-22 11:43:02,275 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182b1706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:43:02, skipping insertion in model container [2018-06-22 11:43:02,275 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:43:01" (2/3) ... [2018-06-22 11:43:02,275 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182b1706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:43:02, skipping insertion in model container [2018-06-22 11:43:02,275 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:43:02" (3/3) ... [2018-06-22 11:43:02,277 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:43:02,286 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:43:02,295 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:43:02,337 INFO ]: Using default assertion order modulation [2018-06-22 11:43:02,337 INFO ]: Interprodecural is true [2018-06-22 11:43:02,337 INFO ]: Hoare is false [2018-06-22 11:43:02,337 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:43:02,337 INFO ]: Backedges is TWOTRACK [2018-06-22 11:43:02,337 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:43:02,337 INFO ]: Difference is false [2018-06-22 11:43:02,337 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:43:02,337 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:43:02,352 INFO ]: Start isEmpty. Operand 27 states. [2018-06-22 11:43:02,366 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:43:02,414 INFO ]: Found error trace [2018-06-22 11:43:02,415 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:02,415 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:02,419 INFO ]: Analyzing trace with hash 1238246040, now seen corresponding path program 1 times [2018-06-22 11:43:02,420 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:02,420 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:02,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:02,453 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:02,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:02,491 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:02,555 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:02,557 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:02,557 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:02,558 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:02,568 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:02,569 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:02,571 INFO ]: Start difference. First operand 27 states. Second operand 4 states. [2018-06-22 11:43:02,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:02,700 INFO ]: Finished difference Result 29 states and 52 transitions. [2018-06-22 11:43:02,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:02,702 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:43:02,702 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:02,714 INFO ]: With dead ends: 29 [2018-06-22 11:43:02,714 INFO ]: Without dead ends: 29 [2018-06-22 11:43:02,716 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 11:43:02,730 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:43:02,755 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 11:43:02,756 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:43:02,757 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 50 transitions. [2018-06-22 11:43:02,759 INFO ]: Start accepts. Automaton has 27 states and 50 transitions. Word has length 9 [2018-06-22 11:43:02,760 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:02,760 INFO ]: Abstraction has 27 states and 50 transitions. [2018-06-22 11:43:02,760 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:02,760 INFO ]: Start isEmpty. Operand 27 states and 50 transitions. [2018-06-22 11:43:02,765 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:43:02,765 INFO ]: Found error trace [2018-06-22 11:43:02,765 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:02,765 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:02,766 INFO ]: Analyzing trace with hash -660937987, now seen corresponding path program 1 times [2018-06-22 11:43:02,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:02,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:02,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:02,766 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:02,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:02,777 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:02,865 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:02,865 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:02,865 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:02,867 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:02,867 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:02,867 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:02,867 INFO ]: Start difference. First operand 27 states and 50 transitions. Second operand 4 states. [2018-06-22 11:43:03,046 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:03,046 INFO ]: Finished difference Result 29 states and 51 transitions. [2018-06-22 11:43:03,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:03,046 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:43:03,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:03,048 INFO ]: With dead ends: 29 [2018-06-22 11:43:03,048 INFO ]: Without dead ends: 29 [2018-06-22 11:43:03,048 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 11:43:03,049 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:43:03,056 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 11:43:03,056 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:43:03,057 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 49 transitions. [2018-06-22 11:43:03,057 INFO ]: Start accepts. Automaton has 27 states and 49 transitions. Word has length 9 [2018-06-22 11:43:03,057 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:03,057 INFO ]: Abstraction has 27 states and 49 transitions. [2018-06-22 11:43:03,057 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:03,058 INFO ]: Start isEmpty. Operand 27 states and 49 transitions. [2018-06-22 11:43:03,059 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:43:03,059 INFO ]: Found error trace [2018-06-22 11:43:03,059 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:03,059 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:03,060 INFO ]: Analyzing trace with hash -1654136471, now seen corresponding path program 1 times [2018-06-22 11:43:03,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:03,060 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:03,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:03,060 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:03,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:03,066 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:03,151 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:03,188 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:03,188 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:03,188 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:03,188 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:03,188 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:03,188 INFO ]: Start difference. First operand 27 states and 49 transitions. Second operand 4 states. [2018-06-22 11:43:03,246 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:03,246 INFO ]: Finished difference Result 29 states and 50 transitions. [2018-06-22 11:43:03,246 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:03,246 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:43:03,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:03,248 INFO ]: With dead ends: 29 [2018-06-22 11:43:03,248 INFO ]: Without dead ends: 29 [2018-06-22 11:43:03,248 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 11:43:03,248 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:43:03,257 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 11:43:03,271 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:43:03,272 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 48 transitions. [2018-06-22 11:43:03,272 INFO ]: Start accepts. Automaton has 27 states and 48 transitions. Word has length 9 [2018-06-22 11:43:03,272 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:03,272 INFO ]: Abstraction has 27 states and 48 transitions. [2018-06-22 11:43:03,272 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:03,272 INFO ]: Start isEmpty. Operand 27 states and 48 transitions. [2018-06-22 11:43:03,274 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:03,274 INFO ]: Found error trace [2018-06-22 11:43:03,274 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:03,274 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:03,274 INFO ]: Analyzing trace with hash 702278614, now seen corresponding path program 1 times [2018-06-22 11:43:03,274 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:03,274 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:03,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:03,275 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:03,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:03,289 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:03,358 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:03,399 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:03,399 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:03,399 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:03,400 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:03,400 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:03,400 INFO ]: Start difference. First operand 27 states and 48 transitions. Second operand 4 states. [2018-06-22 11:43:03,506 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:03,506 INFO ]: Finished difference Result 31 states and 58 transitions. [2018-06-22 11:43:03,507 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:03,507 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:43:03,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:03,508 INFO ]: With dead ends: 31 [2018-06-22 11:43:03,508 INFO ]: Without dead ends: 31 [2018-06-22 11:43:03,509 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 11:43:03,509 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:43:03,517 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:43:03,517 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:43:03,518 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 56 transitions. [2018-06-22 11:43:03,519 INFO ]: Start accepts. Automaton has 29 states and 56 transitions. Word has length 13 [2018-06-22 11:43:03,519 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:03,519 INFO ]: Abstraction has 29 states and 56 transitions. [2018-06-22 11:43:03,519 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:03,519 INFO ]: Start isEmpty. Operand 29 states and 56 transitions. [2018-06-22 11:43:03,520 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:03,521 INFO ]: Found error trace [2018-06-22 11:43:03,521 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:03,521 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:03,521 INFO ]: Analyzing trace with hash -66594886, now seen corresponding path program 1 times [2018-06-22 11:43:03,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:03,521 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:03,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:03,522 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:03,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:03,532 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:03,648 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:03,648 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:03,649 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:03,649 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:03,649 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:03,649 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:03,649 INFO ]: Start difference. First operand 29 states and 56 transitions. Second operand 4 states. [2018-06-22 11:43:03,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:03,827 INFO ]: Finished difference Result 31 states and 57 transitions. [2018-06-22 11:43:03,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:03,827 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:43:03,827 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:03,828 INFO ]: With dead ends: 31 [2018-06-22 11:43:03,828 INFO ]: Without dead ends: 31 [2018-06-22 11:43:03,828 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 11:43:03,829 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:43:03,834 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:43:03,834 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:43:03,834 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions. [2018-06-22 11:43:03,835 INFO ]: Start accepts. Automaton has 29 states and 55 transitions. Word has length 13 [2018-06-22 11:43:03,835 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:03,835 INFO ]: Abstraction has 29 states and 55 transitions. [2018-06-22 11:43:03,835 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:03,835 INFO ]: Start isEmpty. Operand 29 states and 55 transitions. [2018-06-22 11:43:03,836 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:43:03,836 INFO ]: Found error trace [2018-06-22 11:43:03,836 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:03,836 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:03,836 INFO ]: Analyzing trace with hash 1793462338, now seen corresponding path program 1 times [2018-06-22 11:43:03,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:03,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:03,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:03,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:03,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:03,849 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:03,881 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:43:03,881 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:03,881 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:03,881 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:03,881 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:03,882 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:03,882 INFO ]: Start difference. First operand 29 states and 55 transitions. Second operand 4 states. [2018-06-22 11:43:03,975 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:03,975 INFO ]: Finished difference Result 31 states and 56 transitions. [2018-06-22 11:43:03,977 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:03,977 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:43:03,977 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:03,978 INFO ]: With dead ends: 31 [2018-06-22 11:43:03,978 INFO ]: Without dead ends: 31 [2018-06-22 11:43:03,978 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 11:43:03,978 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:43:03,985 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:43:03,985 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:43:03,986 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 54 transitions. [2018-06-22 11:43:03,986 INFO ]: Start accepts. Automaton has 29 states and 54 transitions. Word has length 13 [2018-06-22 11:43:03,986 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:03,986 INFO ]: Abstraction has 29 states and 54 transitions. [2018-06-22 11:43:03,986 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:03,986 INFO ]: Start isEmpty. Operand 29 states and 54 transitions. [2018-06-22 11:43:03,987 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:03,987 INFO ]: Found error trace [2018-06-22 11:43:03,987 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:03,987 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:03,987 INFO ]: Analyzing trace with hash -1395001362, now seen corresponding path program 1 times [2018-06-22 11:43:03,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:03,987 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:03,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:03,988 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:03,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:03,998 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:04,077 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:04,077 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:04,077 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:43:04,077 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:43:04,077 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:43:04,077 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:43:04,078 INFO ]: Start difference. First operand 29 states and 54 transitions. Second operand 5 states. [2018-06-22 11:43:04,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:04,598 INFO ]: Finished difference Result 37 states and 76 transitions. [2018-06-22 11:43:04,600 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:43:04,600 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:43:04,600 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:04,601 INFO ]: With dead ends: 37 [2018-06-22 11:43:04,601 INFO ]: Without dead ends: 37 [2018-06-22 11:43:04,602 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:43:04,602 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:43:04,610 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-06-22 11:43:04,610 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:43:04,611 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 74 transitions. [2018-06-22 11:43:04,611 INFO ]: Start accepts. Automaton has 35 states and 74 transitions. Word has length 17 [2018-06-22 11:43:04,611 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:04,611 INFO ]: Abstraction has 35 states and 74 transitions. [2018-06-22 11:43:04,611 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:43:04,611 INFO ]: Start isEmpty. Operand 35 states and 74 transitions. [2018-06-22 11:43:04,613 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:04,613 INFO ]: Found error trace [2018-06-22 11:43:04,613 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:04,613 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:04,613 INFO ]: Analyzing trace with hash 1318668169, now seen corresponding path program 1 times [2018-06-22 11:43:04,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:04,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:04,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:04,614 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:04,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:04,632 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:04,830 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:04,830 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:04,830 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:43:04,831 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:04,831 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:04,831 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:04,831 INFO ]: Start difference. First operand 35 states and 74 transitions. Second operand 7 states. [2018-06-22 11:43:05,281 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:05,281 INFO ]: Finished difference Result 43 states and 101 transitions. [2018-06-22 11:43:05,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:05,282 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:05,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:05,283 INFO ]: With dead ends: 43 [2018-06-22 11:43:05,283 INFO ]: Without dead ends: 43 [2018-06-22 11:43:05,286 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:05,286 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:43:05,294 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-06-22 11:43:05,294 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:43:05,295 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 89 transitions. [2018-06-22 11:43:05,296 INFO ]: Start accepts. Automaton has 39 states and 89 transitions. Word has length 17 [2018-06-22 11:43:05,296 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:05,296 INFO ]: Abstraction has 39 states and 89 transitions. [2018-06-22 11:43:05,296 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:05,296 INFO ]: Start isEmpty. Operand 39 states and 89 transitions. [2018-06-22 11:43:05,297 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:05,297 INFO ]: Found error trace [2018-06-22 11:43:05,297 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:05,297 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:05,297 INFO ]: Analyzing trace with hash -1857493677, now seen corresponding path program 1 times [2018-06-22 11:43:05,297 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:05,297 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:05,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:05,298 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:05,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:05,308 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:05,359 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:43:05,359 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:05,359 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:43:05,360 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:43:05,360 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:43:05,360 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:43:05,360 INFO ]: Start difference. First operand 39 states and 89 transitions. Second operand 4 states. [2018-06-22 11:43:05,450 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:05,450 INFO ]: Finished difference Result 39 states and 86 transitions. [2018-06-22 11:43:05,450 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:43:05,450 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:43:05,450 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:05,451 INFO ]: With dead ends: 39 [2018-06-22 11:43:05,451 INFO ]: Without dead ends: 39 [2018-06-22 11:43:05,452 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 11:43:05,452 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:43:05,460 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-22 11:43:05,460 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:43:05,461 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 86 transitions. [2018-06-22 11:43:05,461 INFO ]: Start accepts. Automaton has 39 states and 86 transitions. Word has length 17 [2018-06-22 11:43:05,461 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:05,461 INFO ]: Abstraction has 39 states and 86 transitions. [2018-06-22 11:43:05,461 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:43:05,461 INFO ]: Start isEmpty. Operand 39 states and 86 transitions. [2018-06-22 11:43:05,463 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:05,463 INFO ]: Found error trace [2018-06-22 11:43:05,463 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:05,463 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:05,463 INFO ]: Analyzing trace with hash 1747697500, now seen corresponding path program 1 times [2018-06-22 11:43:05,463 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:05,463 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:05,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:05,464 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:05,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:05,476 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:05,710 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:05,711 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:05,711 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:43:05,711 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:05,711 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:05,711 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:05,711 INFO ]: Start difference. First operand 39 states and 86 transitions. Second operand 7 states. [2018-06-22 11:43:06,097 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:06,097 INFO ]: Finished difference Result 45 states and 107 transitions. [2018-06-22 11:43:06,097 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:06,097 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:06,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:06,099 INFO ]: With dead ends: 45 [2018-06-22 11:43:06,099 INFO ]: Without dead ends: 45 [2018-06-22 11:43:06,099 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:06,099 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:43:06,107 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-06-22 11:43:06,107 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:43:06,108 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 95 transitions. [2018-06-22 11:43:06,108 INFO ]: Start accepts. Automaton has 41 states and 95 transitions. Word has length 17 [2018-06-22 11:43:06,108 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:06,108 INFO ]: Abstraction has 41 states and 95 transitions. [2018-06-22 11:43:06,108 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:06,108 INFO ]: Start isEmpty. Operand 41 states and 95 transitions. [2018-06-22 11:43:06,109 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:06,110 INFO ]: Found error trace [2018-06-22 11:43:06,110 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:06,110 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:06,110 INFO ]: Analyzing trace with hash -501046209, now seen corresponding path program 1 times [2018-06-22 11:43:06,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:06,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:06,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:06,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:06,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:06,121 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:06,259 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:06,259 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:06,259 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:43:06,260 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:06,260 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:06,260 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:06,260 INFO ]: Start difference. First operand 41 states and 95 transitions. Second operand 7 states. [2018-06-22 11:43:06,429 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:06,429 INFO ]: Finished difference Result 47 states and 116 transitions. [2018-06-22 11:43:06,430 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:06,430 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:06,430 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:06,432 INFO ]: With dead ends: 47 [2018-06-22 11:43:06,432 INFO ]: Without dead ends: 47 [2018-06-22 11:43:06,432 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:06,432 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:43:06,440 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:43:06,440 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:43:06,441 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 104 transitions. [2018-06-22 11:43:06,441 INFO ]: Start accepts. Automaton has 43 states and 104 transitions. Word has length 17 [2018-06-22 11:43:06,441 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:06,441 INFO ]: Abstraction has 43 states and 104 transitions. [2018-06-22 11:43:06,441 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:06,441 INFO ]: Start isEmpty. Operand 43 states and 104 transitions. [2018-06-22 11:43:06,443 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:06,443 INFO ]: Found error trace [2018-06-22 11:43:06,443 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:06,443 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:06,443 INFO ]: Analyzing trace with hash 1385375788, now seen corresponding path program 1 times [2018-06-22 11:43:06,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:06,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:06,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:06,444 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:06,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:06,453 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:06,539 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:06,539 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:06,539 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:43:06,539 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:06,539 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:06,539 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:06,540 INFO ]: Start difference. First operand 43 states and 104 transitions. Second operand 7 states. [2018-06-22 11:43:06,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:06,772 INFO ]: Finished difference Result 47 states and 115 transitions. [2018-06-22 11:43:06,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:06,772 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:06,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:06,773 INFO ]: With dead ends: 47 [2018-06-22 11:43:06,773 INFO ]: Without dead ends: 47 [2018-06-22 11:43:06,773 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:06,774 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:43:06,782 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:43:06,782 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:43:06,783 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 103 transitions. [2018-06-22 11:43:06,783 INFO ]: Start accepts. Automaton has 43 states and 103 transitions. Word has length 17 [2018-06-22 11:43:06,783 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:06,783 INFO ]: Abstraction has 43 states and 103 transitions. [2018-06-22 11:43:06,783 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:06,783 INFO ]: Start isEmpty. Operand 43 states and 103 transitions. [2018-06-22 11:43:06,784 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:06,784 INFO ]: Found error trace [2018-06-22 11:43:06,784 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:06,784 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:06,784 INFO ]: Analyzing trace with hash 1847868103, now seen corresponding path program 1 times [2018-06-22 11:43:06,784 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:06,784 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:06,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:06,785 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:06,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:06,794 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:06,893 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:06,893 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:06,893 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:43:06,893 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:06,893 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:06,893 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:06,894 INFO ]: Start difference. First operand 43 states and 103 transitions. Second operand 7 states. [2018-06-22 11:43:07,046 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:07,046 INFO ]: Finished difference Result 47 states and 114 transitions. [2018-06-22 11:43:07,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:07,046 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:07,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:07,047 INFO ]: With dead ends: 47 [2018-06-22 11:43:07,047 INFO ]: Without dead ends: 47 [2018-06-22 11:43:07,047 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:07,047 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:43:07,056 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:43:07,056 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:43:07,057 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 102 transitions. [2018-06-22 11:43:07,057 INFO ]: Start accepts. Automaton has 43 states and 102 transitions. Word has length 17 [2018-06-22 11:43:07,058 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:07,058 INFO ]: Abstraction has 43 states and 102 transitions. [2018-06-22 11:43:07,058 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:07,058 INFO ]: Start isEmpty. Operand 43 states and 102 transitions. [2018-06-22 11:43:07,059 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:07,059 INFO ]: Found error trace [2018-06-22 11:43:07,059 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:07,059 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:07,059 INFO ]: Analyzing trace with hash -1089877130, now seen corresponding path program 1 times [2018-06-22 11:43:07,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:07,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:07,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:07,060 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:07,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:07,074 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:07,161 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:07,161 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:07,161 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:43:07,161 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:07,161 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:07,161 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:07,161 INFO ]: Start difference. First operand 43 states and 102 transitions. Second operand 7 states. [2018-06-22 11:43:07,326 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:07,326 INFO ]: Finished difference Result 47 states and 113 transitions. [2018-06-22 11:43:07,329 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:07,329 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:07,329 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:07,330 INFO ]: With dead ends: 47 [2018-06-22 11:43:07,330 INFO ]: Without dead ends: 47 [2018-06-22 11:43:07,330 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:07,330 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:43:07,338 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:43:07,338 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:43:07,343 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 101 transitions. [2018-06-22 11:43:07,343 INFO ]: Start accepts. Automaton has 43 states and 101 transitions. Word has length 17 [2018-06-22 11:43:07,343 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:07,343 INFO ]: Abstraction has 43 states and 101 transitions. [2018-06-22 11:43:07,343 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:07,343 INFO ]: Start isEmpty. Operand 43 states and 101 transitions. [2018-06-22 11:43:07,344 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:07,344 INFO ]: Found error trace [2018-06-22 11:43:07,344 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:07,344 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:07,345 INFO ]: Analyzing trace with hash -2101157, now seen corresponding path program 1 times [2018-06-22 11:43:07,345 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:07,345 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:07,345 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:07,345 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:07,345 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:07,353 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:07,432 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:07,432 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:07,432 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:43:07,432 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:07,432 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:07,432 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:07,432 INFO ]: Start difference. First operand 43 states and 101 transitions. Second operand 7 states. [2018-06-22 11:43:07,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:07,588 INFO ]: Finished difference Result 47 states and 112 transitions. [2018-06-22 11:43:07,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:07,591 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:07,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:07,592 INFO ]: With dead ends: 47 [2018-06-22 11:43:07,592 INFO ]: Without dead ends: 47 [2018-06-22 11:43:07,593 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:07,593 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:43:07,601 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:43:07,601 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:43:07,602 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 100 transitions. [2018-06-22 11:43:07,602 INFO ]: Start accepts. Automaton has 43 states and 100 transitions. Word has length 17 [2018-06-22 11:43:07,602 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:07,602 INFO ]: Abstraction has 43 states and 100 transitions. [2018-06-22 11:43:07,602 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:07,602 INFO ]: Start isEmpty. Operand 43 states and 100 transitions. [2018-06-22 11:43:07,603 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:07,603 INFO ]: Found error trace [2018-06-22 11:43:07,604 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:07,604 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:07,604 INFO ]: Analyzing trace with hash -660847799, now seen corresponding path program 1 times [2018-06-22 11:43:07,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:07,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:07,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:07,605 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:07,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:07,612 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:07,705 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:07,705 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:07,705 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:43:07,705 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:07,705 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:07,705 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:07,705 INFO ]: Start difference. First operand 43 states and 100 transitions. Second operand 7 states. [2018-06-22 11:43:08,297 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:08,297 INFO ]: Finished difference Result 47 states and 111 transitions. [2018-06-22 11:43:08,298 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:08,298 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:08,298 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:08,299 INFO ]: With dead ends: 47 [2018-06-22 11:43:08,299 INFO ]: Without dead ends: 47 [2018-06-22 11:43:08,299 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:08,299 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:43:08,305 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:43:08,305 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:43:08,306 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 99 transitions. [2018-06-22 11:43:08,306 INFO ]: Start accepts. Automaton has 43 states and 99 transitions. Word has length 17 [2018-06-22 11:43:08,306 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:08,306 INFO ]: Abstraction has 43 states and 99 transitions. [2018-06-22 11:43:08,306 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:08,306 INFO ]: Start isEmpty. Operand 43 states and 99 transitions. [2018-06-22 11:43:08,307 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:08,307 INFO ]: Found error trace [2018-06-22 11:43:08,307 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:08,307 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:08,307 INFO ]: Analyzing trace with hash -1239727616, now seen corresponding path program 1 times [2018-06-22 11:43:08,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:08,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:08,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:08,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:08,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:08,316 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:08,568 WARN ]: Spent 133.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-06-22 11:43:08,594 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:08,594 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:08,594 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:43:08,594 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:08,594 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:08,594 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:08,595 INFO ]: Start difference. First operand 43 states and 99 transitions. Second operand 7 states. [2018-06-22 11:43:08,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:08,913 INFO ]: Finished difference Result 47 states and 110 transitions. [2018-06-22 11:43:08,913 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:08,913 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:08,913 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:08,914 INFO ]: With dead ends: 47 [2018-06-22 11:43:08,914 INFO ]: Without dead ends: 47 [2018-06-22 11:43:08,914 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:08,914 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:43:08,918 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:43:08,918 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:43:08,919 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 98 transitions. [2018-06-22 11:43:08,919 INFO ]: Start accepts. Automaton has 43 states and 98 transitions. Word has length 17 [2018-06-22 11:43:08,919 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:08,919 INFO ]: Abstraction has 43 states and 98 transitions. [2018-06-22 11:43:08,919 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:08,919 INFO ]: Start isEmpty. Operand 43 states and 98 transitions. [2018-06-22 11:43:08,921 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:08,921 INFO ]: Found error trace [2018-06-22 11:43:08,921 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:08,921 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:08,921 INFO ]: Analyzing trace with hash -198355484, now seen corresponding path program 1 times [2018-06-22 11:43:08,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:08,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:08,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:08,922 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:08,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:08,930 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:09,046 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:09,055 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:09,055 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:43:09,055 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:09,055 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:09,055 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:09,056 INFO ]: Start difference. First operand 43 states and 98 transitions. Second operand 7 states. [2018-06-22 11:43:09,187 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:09,187 INFO ]: Finished difference Result 47 states and 109 transitions. [2018-06-22 11:43:09,187 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:09,187 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:09,187 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:09,188 INFO ]: With dead ends: 47 [2018-06-22 11:43:09,188 INFO ]: Without dead ends: 47 [2018-06-22 11:43:09,188 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:09,188 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:43:09,193 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:43:09,193 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:43:09,194 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 97 transitions. [2018-06-22 11:43:09,194 INFO ]: Start accepts. Automaton has 43 states and 97 transitions. Word has length 17 [2018-06-22 11:43:09,194 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:09,194 INFO ]: Abstraction has 43 states and 97 transitions. [2018-06-22 11:43:09,194 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:09,194 INFO ]: Start isEmpty. Operand 43 states and 97 transitions. [2018-06-22 11:43:09,195 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:09,195 INFO ]: Found error trace [2018-06-22 11:43:09,195 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:09,195 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:09,195 INFO ]: Analyzing trace with hash -627384815, now seen corresponding path program 1 times [2018-06-22 11:43:09,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:09,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:09,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:09,196 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:09,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:09,202 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:09,521 WARN ]: Spent 205.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-06-22 11:43:09,661 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:09,732 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:09,732 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:43:09,732 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:09,732 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:09,732 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:09,733 INFO ]: Start difference. First operand 43 states and 97 transitions. Second operand 7 states. [2018-06-22 11:43:10,126 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:10,126 INFO ]: Finished difference Result 47 states and 108 transitions. [2018-06-22 11:43:10,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:10,126 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:10,127 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:10,127 INFO ]: With dead ends: 47 [2018-06-22 11:43:10,127 INFO ]: Without dead ends: 47 [2018-06-22 11:43:10,127 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:10,128 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:43:10,132 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:43:10,132 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:43:10,135 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 96 transitions. [2018-06-22 11:43:10,135 INFO ]: Start accepts. Automaton has 43 states and 96 transitions. Word has length 17 [2018-06-22 11:43:10,135 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:10,135 INFO ]: Abstraction has 43 states and 96 transitions. [2018-06-22 11:43:10,135 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:10,135 INFO ]: Start isEmpty. Operand 43 states and 96 transitions. [2018-06-22 11:43:10,136 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:43:10,136 INFO ]: Found error trace [2018-06-22 11:43:10,136 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:10,136 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:10,136 INFO ]: Analyzing trace with hash -2048324744, now seen corresponding path program 1 times [2018-06-22 11:43:10,136 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:10,136 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:10,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:10,137 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:10,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:10,144 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:10,448 WARN ]: Spent 187.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-06-22 11:43:10,799 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:43:10,799 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:10,799 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:43:10,800 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:43:10,800 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:43:10,800 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:10,800 INFO ]: Start difference. First operand 43 states and 96 transitions. Second operand 7 states. [2018-06-22 11:43:11,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:11,137 INFO ]: Finished difference Result 47 states and 107 transitions. [2018-06-22 11:43:11,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:11,138 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:43:11,138 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:11,138 INFO ]: With dead ends: 47 [2018-06-22 11:43:11,138 INFO ]: Without dead ends: 47 [2018-06-22 11:43:11,139 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:11,139 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:43:11,143 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:43:11,143 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:43:11,143 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 95 transitions. [2018-06-22 11:43:11,144 INFO ]: Start accepts. Automaton has 43 states and 95 transitions. Word has length 17 [2018-06-22 11:43:11,144 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:11,144 INFO ]: Abstraction has 43 states and 95 transitions. [2018-06-22 11:43:11,144 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:43:11,144 INFO ]: Start isEmpty. Operand 43 states and 95 transitions. [2018-06-22 11:43:11,150 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:11,150 INFO ]: Found error trace [2018-06-22 11:43:11,150 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:11,150 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:11,150 INFO ]: Analyzing trace with hash 1670836641, now seen corresponding path program 1 times [2018-06-22 11:43:11,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:11,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:11,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:11,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:11,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:11,167 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:11,331 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:43:11,331 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:11,331 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:43:11,331 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:11,332 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:11,332 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:11,332 INFO ]: Start difference. First operand 43 states and 95 transitions. Second operand 8 states. [2018-06-22 11:43:11,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:11,637 INFO ]: Finished difference Result 55 states and 145 transitions. [2018-06-22 11:43:11,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:11,637 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:43:11,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:11,638 INFO ]: With dead ends: 55 [2018-06-22 11:43:11,638 INFO ]: Without dead ends: 55 [2018-06-22 11:43:11,638 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:11,638 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:43:11,645 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-06-22 11:43:11,645 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:43:11,645 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 104 transitions. [2018-06-22 11:43:11,645 INFO ]: Start accepts. Automaton has 45 states and 104 transitions. Word has length 21 [2018-06-22 11:43:11,646 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:11,646 INFO ]: Abstraction has 45 states and 104 transitions. [2018-06-22 11:43:11,646 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:11,646 INFO ]: Start isEmpty. Operand 45 states and 104 transitions. [2018-06-22 11:43:11,647 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:11,647 INFO ]: Found error trace [2018-06-22 11:43:11,647 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:11,647 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:11,647 INFO ]: Analyzing trace with hash 1427999768, now seen corresponding path program 1 times [2018-06-22 11:43:11,647 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:11,647 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:11,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:11,648 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:11,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:11,657 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:12,228 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:43:12,228 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:12,228 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 11:43:12,237 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:12,273 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:12,283 INFO ]: Computing forward predicates... [2018-06-22 11:43:12,614 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:43:12,646 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:12,646 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 11:43:12,647 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:43:12,647 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:43:12,647 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:12,647 INFO ]: Start difference. First operand 45 states and 104 transitions. Second operand 9 states. [2018-06-22 11:43:13,258 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:13,258 INFO ]: Finished difference Result 61 states and 158 transitions. [2018-06-22 11:43:13,258 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:13,258 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 11:43:13,258 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:13,259 INFO ]: With dead ends: 61 [2018-06-22 11:43:13,259 INFO ]: Without dead ends: 61 [2018-06-22 11:43:13,260 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:43:13,260 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:43:13,268 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 55. [2018-06-22 11:43:13,268 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:43:13,268 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 137 transitions. [2018-06-22 11:43:13,269 INFO ]: Start accepts. Automaton has 55 states and 137 transitions. Word has length 21 [2018-06-22 11:43:13,269 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:13,269 INFO ]: Abstraction has 55 states and 137 transitions. [2018-06-22 11:43:13,269 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:43:13,269 INFO ]: Start isEmpty. Operand 55 states and 137 transitions. [2018-06-22 11:43:13,270 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:13,270 INFO ]: Found error trace [2018-06-22 11:43:13,270 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:13,270 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:13,270 INFO ]: Analyzing trace with hash -1574635989, now seen corresponding path program 1 times [2018-06-22 11:43:13,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:13,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:13,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:13,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:13,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:13,286 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:13,631 WARN ]: Spent 197.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-06-22 11:43:13,940 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:43:13,940 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:13,940 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:43:13,940 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:13,940 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:13,940 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:13,941 INFO ]: Start difference. First operand 55 states and 137 transitions. Second operand 8 states. [2018-06-22 11:43:14,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:14,522 INFO ]: Finished difference Result 69 states and 196 transitions. [2018-06-22 11:43:14,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:14,522 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:43:14,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:14,523 INFO ]: With dead ends: 69 [2018-06-22 11:43:14,523 INFO ]: Without dead ends: 69 [2018-06-22 11:43:14,523 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:14,523 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:43:14,531 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 57. [2018-06-22 11:43:14,531 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:43:14,531 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 146 transitions. [2018-06-22 11:43:14,531 INFO ]: Start accepts. Automaton has 57 states and 146 transitions. Word has length 21 [2018-06-22 11:43:14,532 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:14,532 INFO ]: Abstraction has 57 states and 146 transitions. [2018-06-22 11:43:14,532 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:14,532 INFO ]: Start isEmpty. Operand 57 states and 146 transitions. [2018-06-22 11:43:14,537 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:14,538 INFO ]: Found error trace [2018-06-22 11:43:14,538 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:14,538 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:14,538 INFO ]: Analyzing trace with hash -619119484, now seen corresponding path program 1 times [2018-06-22 11:43:14,538 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:14,538 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:14,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:14,538 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:14,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:14,544 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:14,607 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:43:14,607 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:14,607 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 11:43:14,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:14,638 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:14,641 INFO ]: Computing forward predicates... [2018-06-22 11:43:14,703 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:43:14,728 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:14,728 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 11:43:14,728 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:43:14,728 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:43:14,728 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:14,728 INFO ]: Start difference. First operand 57 states and 146 transitions. Second operand 9 states. [2018-06-22 11:43:14,903 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:14,903 INFO ]: Finished difference Result 69 states and 185 transitions. [2018-06-22 11:43:14,903 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:14,903 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 11:43:14,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:14,904 INFO ]: With dead ends: 69 [2018-06-22 11:43:14,904 INFO ]: Without dead ends: 69 [2018-06-22 11:43:14,905 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:43:14,905 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:43:14,913 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 63. [2018-06-22 11:43:14,913 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:43:14,914 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 164 transitions. [2018-06-22 11:43:14,914 INFO ]: Start accepts. Automaton has 63 states and 164 transitions. Word has length 21 [2018-06-22 11:43:14,914 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:14,914 INFO ]: Abstraction has 63 states and 164 transitions. [2018-06-22 11:43:14,914 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:43:14,915 INFO ]: Start isEmpty. Operand 63 states and 164 transitions. [2018-06-22 11:43:14,916 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:14,916 INFO ]: Found error trace [2018-06-22 11:43:14,916 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:14,916 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:14,916 INFO ]: Analyzing trace with hash -832697842, now seen corresponding path program 1 times [2018-06-22 11:43:14,916 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:14,916 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:14,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:14,921 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:14,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:14,930 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:15,137 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:43:15,137 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:15,137 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:43:15,137 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:15,137 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:15,137 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:15,137 INFO ]: Start difference. First operand 63 states and 164 transitions. Second operand 8 states. [2018-06-22 11:43:15,350 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:15,350 INFO ]: Finished difference Result 75 states and 212 transitions. [2018-06-22 11:43:15,351 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:15,351 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:43:15,351 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:15,352 INFO ]: With dead ends: 75 [2018-06-22 11:43:15,352 INFO ]: Without dead ends: 75 [2018-06-22 11:43:15,352 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:15,352 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:43:15,358 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 63. [2018-06-22 11:43:15,358 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:43:15,359 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 163 transitions. [2018-06-22 11:43:15,360 INFO ]: Start accepts. Automaton has 63 states and 163 transitions. Word has length 21 [2018-06-22 11:43:15,360 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:15,360 INFO ]: Abstraction has 63 states and 163 transitions. [2018-06-22 11:43:15,360 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:15,360 INFO ]: Start isEmpty. Operand 63 states and 163 transitions. [2018-06-22 11:43:15,361 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:15,361 INFO ]: Found error trace [2018-06-22 11:43:15,361 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:15,361 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:15,361 INFO ]: Analyzing trace with hash 1776383421, now seen corresponding path program 1 times [2018-06-22 11:43:15,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:15,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:15,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:15,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:15,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:15,371 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:15,695 WARN ]: Spent 202.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-06-22 11:43:16,338 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:43:16,339 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:16,339 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:43:16,339 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:16,339 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:16,339 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:16,339 INFO ]: Start difference. First operand 63 states and 163 transitions. Second operand 8 states. [2018-06-22 11:43:16,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:16,598 INFO ]: Finished difference Result 75 states and 210 transitions. [2018-06-22 11:43:16,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:16,598 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:43:16,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:16,599 INFO ]: With dead ends: 75 [2018-06-22 11:43:16,599 INFO ]: Without dead ends: 75 [2018-06-22 11:43:16,600 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:16,600 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:43:16,607 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 63. [2018-06-22 11:43:16,607 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:43:16,608 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 162 transitions. [2018-06-22 11:43:16,608 INFO ]: Start accepts. Automaton has 63 states and 162 transitions. Word has length 21 [2018-06-22 11:43:16,608 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:16,608 INFO ]: Abstraction has 63 states and 162 transitions. [2018-06-22 11:43:16,608 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:16,608 INFO ]: Start isEmpty. Operand 63 states and 162 transitions. [2018-06-22 11:43:16,609 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:16,609 INFO ]: Found error trace [2018-06-22 11:43:16,609 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:16,609 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:16,610 INFO ]: Analyzing trace with hash 216796824, now seen corresponding path program 1 times [2018-06-22 11:43:16,610 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:16,610 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:16,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:16,610 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:16,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:16,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:16,803 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:43:16,804 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:16,804 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:43:16,804 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:16,804 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:16,804 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:16,804 INFO ]: Start difference. First operand 63 states and 162 transitions. Second operand 8 states. [2018-06-22 11:43:17,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:17,144 INFO ]: Finished difference Result 75 states and 208 transitions. [2018-06-22 11:43:17,145 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:17,145 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:43:17,145 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:17,146 INFO ]: With dead ends: 75 [2018-06-22 11:43:17,146 INFO ]: Without dead ends: 75 [2018-06-22 11:43:17,146 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:17,147 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:43:17,153 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 63. [2018-06-22 11:43:17,153 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:43:17,154 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 161 transitions. [2018-06-22 11:43:17,154 INFO ]: Start accepts. Automaton has 63 states and 161 transitions. Word has length 21 [2018-06-22 11:43:17,154 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:17,154 INFO ]: Abstraction has 63 states and 161 transitions. [2018-06-22 11:43:17,154 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:17,154 INFO ]: Start isEmpty. Operand 63 states and 161 transitions. [2018-06-22 11:43:17,155 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:17,155 INFO ]: Found error trace [2018-06-22 11:43:17,155 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:17,155 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:17,155 INFO ]: Analyzing trace with hash -270735831, now seen corresponding path program 1 times [2018-06-22 11:43:17,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:17,156 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:17,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:17,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:17,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:17,163 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:17,368 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:43:17,416 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:17,417 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:43:17,417 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:17,417 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:17,417 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:17,417 INFO ]: Start difference. First operand 63 states and 161 transitions. Second operand 8 states. [2018-06-22 11:43:18,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:18,123 INFO ]: Finished difference Result 75 states and 206 transitions. [2018-06-22 11:43:18,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:18,126 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:43:18,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:18,127 INFO ]: With dead ends: 75 [2018-06-22 11:43:18,127 INFO ]: Without dead ends: 75 [2018-06-22 11:43:18,128 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:18,128 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:43:18,136 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 63. [2018-06-22 11:43:18,136 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 11:43:18,137 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 160 transitions. [2018-06-22 11:43:18,137 INFO ]: Start accepts. Automaton has 63 states and 160 transitions. Word has length 21 [2018-06-22 11:43:18,137 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:18,137 INFO ]: Abstraction has 63 states and 160 transitions. [2018-06-22 11:43:18,137 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:18,137 INFO ]: Start isEmpty. Operand 63 states and 160 transitions. [2018-06-22 11:43:18,139 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:18,139 INFO ]: Found error trace [2018-06-22 11:43:18,139 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:18,139 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:18,139 INFO ]: Analyzing trace with hash -2143243670, now seen corresponding path program 1 times [2018-06-22 11:43:18,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:18,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:18,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:18,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:18,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:18,145 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:18,304 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:43:18,304 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:18,304 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:43:18,304 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:18,304 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:18,304 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:18,304 INFO ]: Start difference. First operand 63 states and 160 transitions. Second operand 8 states. [2018-06-22 11:43:18,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:18,567 INFO ]: Finished difference Result 79 states and 224 transitions. [2018-06-22 11:43:18,567 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:18,567 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:43:18,567 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:18,569 INFO ]: With dead ends: 79 [2018-06-22 11:43:18,569 INFO ]: Without dead ends: 79 [2018-06-22 11:43:18,569 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:18,569 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:43:18,578 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 65. [2018-06-22 11:43:18,578 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:43:18,579 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 169 transitions. [2018-06-22 11:43:18,579 INFO ]: Start accepts. Automaton has 65 states and 169 transitions. Word has length 21 [2018-06-22 11:43:18,579 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:18,579 INFO ]: Abstraction has 65 states and 169 transitions. [2018-06-22 11:43:18,579 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:18,579 INFO ]: Start isEmpty. Operand 65 states and 169 transitions. [2018-06-22 11:43:18,580 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:18,580 INFO ]: Found error trace [2018-06-22 11:43:18,580 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:18,580 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:18,580 INFO ]: Analyzing trace with hash -1958091624, now seen corresponding path program 1 times [2018-06-22 11:43:18,580 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:18,580 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:18,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:18,581 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:18,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:18,596 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:19,024 WARN ]: Spent 342.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-06-22 11:43:19,098 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:43:19,098 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:19,098 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:43:19,098 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:43:19,098 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:43:19,098 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:19,099 INFO ]: Start difference. First operand 65 states and 169 transitions. Second operand 6 states. [2018-06-22 11:43:19,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:19,307 INFO ]: Finished difference Result 71 states and 195 transitions. [2018-06-22 11:43:19,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:19,307 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:43:19,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:19,307 INFO ]: With dead ends: 71 [2018-06-22 11:43:19,307 INFO ]: Without dead ends: 71 [2018-06-22 11:43:19,308 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:43:19,308 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:43:19,313 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-06-22 11:43:19,313 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:43:19,314 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 168 transitions. [2018-06-22 11:43:19,314 INFO ]: Start accepts. Automaton has 65 states and 168 transitions. Word has length 21 [2018-06-22 11:43:19,314 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:19,314 INFO ]: Abstraction has 65 states and 168 transitions. [2018-06-22 11:43:19,314 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:43:19,314 INFO ]: Start isEmpty. Operand 65 states and 168 transitions. [2018-06-22 11:43:19,316 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:19,316 INFO ]: Found error trace [2018-06-22 11:43:19,316 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:19,316 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:19,316 INFO ]: Analyzing trace with hash 2046176846, now seen corresponding path program 1 times [2018-06-22 11:43:19,316 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:19,316 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:19,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:19,317 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:19,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:19,325 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:19,563 WARN ]: Spent 120.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-06-22 11:43:19,649 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:43:19,649 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:19,649 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:43:19,649 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:19,649 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:19,649 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:19,649 INFO ]: Start difference. First operand 65 states and 168 transitions. Second operand 8 states. [2018-06-22 11:43:19,954 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:19,954 INFO ]: Finished difference Result 79 states and 221 transitions. [2018-06-22 11:43:19,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:19,954 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:43:19,954 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:19,955 INFO ]: With dead ends: 79 [2018-06-22 11:43:19,955 INFO ]: Without dead ends: 79 [2018-06-22 11:43:19,955 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:19,955 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:43:19,962 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 65. [2018-06-22 11:43:19,962 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:43:19,963 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 167 transitions. [2018-06-22 11:43:19,963 INFO ]: Start accepts. Automaton has 65 states and 167 transitions. Word has length 21 [2018-06-22 11:43:19,963 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:19,963 INFO ]: Abstraction has 65 states and 167 transitions. [2018-06-22 11:43:19,963 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:19,963 INFO ]: Start isEmpty. Operand 65 states and 167 transitions. [2018-06-22 11:43:19,964 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:19,964 INFO ]: Found error trace [2018-06-22 11:43:19,964 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:19,964 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:19,964 INFO ]: Analyzing trace with hash 1616125590, now seen corresponding path program 1 times [2018-06-22 11:43:19,964 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:19,964 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:19,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:19,965 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:19,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:19,973 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:20,288 WARN ]: Spent 204.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-06-22 11:43:20,644 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:43:20,644 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:20,644 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:43:20,644 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:20,645 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:20,645 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:20,645 INFO ]: Start difference. First operand 65 states and 167 transitions. Second operand 8 states. [2018-06-22 11:43:20,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:20,997 INFO ]: Finished difference Result 79 states and 219 transitions. [2018-06-22 11:43:20,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:20,999 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:43:20,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:21,000 INFO ]: With dead ends: 79 [2018-06-22 11:43:21,000 INFO ]: Without dead ends: 79 [2018-06-22 11:43:21,000 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:21,001 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:43:21,009 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 65. [2018-06-22 11:43:21,009 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:43:21,010 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 166 transitions. [2018-06-22 11:43:21,010 INFO ]: Start accepts. Automaton has 65 states and 166 transitions. Word has length 21 [2018-06-22 11:43:21,011 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:21,011 INFO ]: Abstraction has 65 states and 166 transitions. [2018-06-22 11:43:21,011 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:21,011 INFO ]: Start isEmpty. Operand 65 states and 166 transitions. [2018-06-22 11:43:21,012 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:21,012 INFO ]: Found error trace [2018-06-22 11:43:21,012 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:21,014 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:21,014 INFO ]: Analyzing trace with hash -2116879695, now seen corresponding path program 1 times [2018-06-22 11:43:21,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:21,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:21,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:21,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:21,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:21,023 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:21,126 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:43:21,126 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:21,126 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:43:21,126 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:21,126 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:21,126 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:21,126 INFO ]: Start difference. First operand 65 states and 166 transitions. Second operand 8 states. [2018-06-22 11:43:21,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:21,522 INFO ]: Finished difference Result 79 states and 217 transitions. [2018-06-22 11:43:21,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:21,522 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:43:21,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:21,523 INFO ]: With dead ends: 79 [2018-06-22 11:43:21,523 INFO ]: Without dead ends: 79 [2018-06-22 11:43:21,523 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:21,523 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:43:21,530 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 65. [2018-06-22 11:43:21,530 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:43:21,531 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 165 transitions. [2018-06-22 11:43:21,531 INFO ]: Start accepts. Automaton has 65 states and 165 transitions. Word has length 21 [2018-06-22 11:43:21,531 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:21,531 INFO ]: Abstraction has 65 states and 165 transitions. [2018-06-22 11:43:21,531 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:21,531 INFO ]: Start isEmpty. Operand 65 states and 165 transitions. [2018-06-22 11:43:21,533 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:21,533 INFO ]: Found error trace [2018-06-22 11:43:21,533 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:21,533 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:21,533 INFO ]: Analyzing trace with hash 604394018, now seen corresponding path program 1 times [2018-06-22 11:43:21,533 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:21,533 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:21,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:21,533 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:21,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:21,539 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:21,659 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:43:21,659 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:21,659 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:43:21,660 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:21,660 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:21,660 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:21,660 INFO ]: Start difference. First operand 65 states and 165 transitions. Second operand 8 states. [2018-06-22 11:43:21,941 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:21,941 INFO ]: Finished difference Result 79 states and 215 transitions. [2018-06-22 11:43:21,941 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:21,941 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:43:21,941 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:21,942 INFO ]: With dead ends: 79 [2018-06-22 11:43:21,942 INFO ]: Without dead ends: 79 [2018-06-22 11:43:21,942 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:21,942 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:43:21,948 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 65. [2018-06-22 11:43:21,949 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:43:21,949 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 164 transitions. [2018-06-22 11:43:21,949 INFO ]: Start accepts. Automaton has 65 states and 164 transitions. Word has length 21 [2018-06-22 11:43:21,950 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:21,950 INFO ]: Abstraction has 65 states and 164 transitions. [2018-06-22 11:43:21,950 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:21,950 INFO ]: Start isEmpty. Operand 65 states and 164 transitions. [2018-06-22 11:43:21,950 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:21,950 INFO ]: Found error trace [2018-06-22 11:43:21,950 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:21,951 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:21,951 INFO ]: Analyzing trace with hash -1442725234, now seen corresponding path program 1 times [2018-06-22 11:43:21,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:21,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:21,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:21,951 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:21,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:21,958 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:22,022 INFO ]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:43:22,022 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:22,022 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 11:43:22,022 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:43:22,022 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:43:22,022 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:43:22,023 INFO ]: Start difference. First operand 65 states and 164 transitions. Second operand 8 states. [2018-06-22 11:43:22,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:22,296 INFO ]: Finished difference Result 79 states and 213 transitions. [2018-06-22 11:43:22,297 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:22,297 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:43:22,297 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:22,298 INFO ]: With dead ends: 79 [2018-06-22 11:43:22,298 INFO ]: Without dead ends: 79 [2018-06-22 11:43:22,298 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:43:22,298 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:43:22,305 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 65. [2018-06-22 11:43:22,305 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:43:22,306 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 163 transitions. [2018-06-22 11:43:22,306 INFO ]: Start accepts. Automaton has 65 states and 163 transitions. Word has length 21 [2018-06-22 11:43:22,306 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:22,306 INFO ]: Abstraction has 65 states and 163 transitions. [2018-06-22 11:43:22,306 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:43:22,306 INFO ]: Start isEmpty. Operand 65 states and 163 transitions. [2018-06-22 11:43:22,307 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:22,307 INFO ]: Found error trace [2018-06-22 11:43:22,307 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:22,307 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:22,307 INFO ]: Analyzing trace with hash -1630851056, now seen corresponding path program 1 times [2018-06-22 11:43:22,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:22,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:22,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:22,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:22,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:22,327 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:22,589 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:43:22,589 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:22,589 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 11:43:22,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:22,620 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:22,622 INFO ]: Computing forward predicates... [2018-06-22 11:43:22,630 WARN ]: unable to prove that (exists ((INV_MAIN_2_hhv_INV_MAIN_2_0_Int Int)) (= (let ((.cse1 (+ INV_MAIN_2_hhv_INV_MAIN_2_0_Int (* 4 c_INV_MAIN_2_hbv_INV_MAIN_2_1_Int))) (.cse0 (+ INV_MAIN_2_hhv_INV_MAIN_2_0_Int (* 4 c_INV_MAIN_2_hhv_INV_MAIN_2_1_Int)))) (store (store c_INV_MAIN_2_hbv_INV_MAIN_2_2_Array_Int_Int .cse0 (select c_INV_MAIN_2_hbv_INV_MAIN_2_2_Array_Int_Int .cse1)) .cse1 (select c_INV_MAIN_2_hbv_INV_MAIN_2_2_Array_Int_Int .cse0))) c_INV_MAIN_2_hhv_INV_MAIN_2_4_Array_Int_Int)) is different from true [2018-06-22 11:43:22,666 WARN ]: unable to prove that (exists ((INV_MAIN_2_hhv_INV_MAIN_2_0_Int Int) (INV_MAIN_2_hbv_INV_MAIN_2_1_Int Int) (INV_MAIN_2_hhv_INV_MAIN_2_1_Int Int)) (and (<= INV_MAIN_2_hbv_INV_MAIN_2_1_Int INV_MAIN_2_hhv_INV_MAIN_2_1_Int) (= c_INV_MAIN_2_hhv_INV_MAIN_2_4_Array_Int_Int (let ((.cse1 (+ INV_MAIN_2_hhv_INV_MAIN_2_0_Int (* 4 INV_MAIN_2_hbv_INV_MAIN_2_1_Int))) (.cse0 (+ INV_MAIN_2_hhv_INV_MAIN_2_0_Int (* 4 INV_MAIN_2_hhv_INV_MAIN_2_1_Int)))) (store (store c_INV_MAIN_2_hhv_INV_MAIN_2_9_Array_Int_Int .cse0 (select c_INV_MAIN_2_hhv_INV_MAIN_2_9_Array_Int_Int .cse1)) .cse1 (select c_INV_MAIN_2_hhv_INV_MAIN_2_9_Array_Int_Int .cse0)))) (<= INV_MAIN_2_hhv_INV_MAIN_2_1_Int INV_MAIN_2_hbv_INV_MAIN_2_1_Int))) is different from true [2018-06-22 11:43:22,696 WARN ]: unable to prove that (exists ((INV_MAIN_2_hhv_INV_MAIN_2_0_Int Int) (INV_MAIN_2_hbv_INV_MAIN_2_1_Int Int) (INV_MAIN_2_hhv_INV_MAIN_2_1_Int Int)) (and (<= INV_MAIN_2_hbv_INV_MAIN_2_1_Int INV_MAIN_2_hhv_INV_MAIN_2_1_Int) (= (let ((.cse1 (+ INV_MAIN_2_hhv_INV_MAIN_2_0_Int (* 4 INV_MAIN_2_hbv_INV_MAIN_2_1_Int))) (.cse0 (+ INV_MAIN_2_hhv_INV_MAIN_2_0_Int (* 4 INV_MAIN_2_hhv_INV_MAIN_2_1_Int)))) (store (store c_INV_MAIN_1_hhv_INV_MAIN_1_7_Array_Int_Int .cse0 (select c_INV_MAIN_1_hhv_INV_MAIN_1_7_Array_Int_Int .cse1)) .cse1 (select c_INV_MAIN_1_hhv_INV_MAIN_1_7_Array_Int_Int .cse0))) c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int) (<= INV_MAIN_2_hhv_INV_MAIN_2_1_Int INV_MAIN_2_hbv_INV_MAIN_2_1_Int))) is different from true [2018-06-22 11:43:22,731 INFO ]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2018-06-22 11:43:22,750 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:22,750 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-22 11:43:22,750 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:43:22,750 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:43:22,751 INFO ]: CoverageRelationStatistics Valid=28, Invalid=71, Unknown=3, NotChecked=54, Total=156 [2018-06-22 11:43:22,751 INFO ]: Start difference. First operand 65 states and 163 transitions. Second operand 13 states. [2018-06-22 11:43:23,283 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:23,283 INFO ]: Finished difference Result 83 states and 204 transitions. [2018-06-22 11:43:23,284 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:43:23,284 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 11:43:23,284 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:23,284 INFO ]: With dead ends: 83 [2018-06-22 11:43:23,284 INFO ]: Without dead ends: 83 [2018-06-22 11:43:23,285 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=162, Unknown=11, NotChecked=84, Total=306 [2018-06-22 11:43:23,285 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 11:43:23,291 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-06-22 11:43:23,291 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 11:43:23,292 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 202 transitions. [2018-06-22 11:43:23,292 INFO ]: Start accepts. Automaton has 81 states and 202 transitions. Word has length 21 [2018-06-22 11:43:23,293 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:23,293 INFO ]: Abstraction has 81 states and 202 transitions. [2018-06-22 11:43:23,293 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:43:23,293 INFO ]: Start isEmpty. Operand 81 states and 202 transitions. [2018-06-22 11:43:23,294 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:23,294 INFO ]: Found error trace [2018-06-22 11:43:23,294 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:23,294 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:23,294 INFO ]: Analyzing trace with hash 2102154229, now seen corresponding path program 1 times [2018-06-22 11:43:23,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:23,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:23,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:23,295 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:23,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:23,303 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:23,410 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:43:23,410 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:23,410 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:23,417 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:23,432 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:23,434 INFO ]: Computing forward predicates... [2018-06-22 11:43:23,558 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:43:23,588 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:23,589 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 11:43:23,589 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:43:23,589 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:43:23,589 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:23,589 INFO ]: Start difference. First operand 81 states and 202 transitions. Second operand 9 states. [2018-06-22 11:43:23,838 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:23,838 INFO ]: Finished difference Result 89 states and 224 transitions. [2018-06-22 11:43:23,838 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:23,838 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 11:43:23,839 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:23,840 INFO ]: With dead ends: 89 [2018-06-22 11:43:23,840 INFO ]: Without dead ends: 89 [2018-06-22 11:43:23,840 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:43:23,840 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-22 11:43:23,848 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 77. [2018-06-22 11:43:23,848 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:43:23,849 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 187 transitions. [2018-06-22 11:43:23,849 INFO ]: Start accepts. Automaton has 77 states and 187 transitions. Word has length 21 [2018-06-22 11:43:23,849 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:23,849 INFO ]: Abstraction has 77 states and 187 transitions. [2018-06-22 11:43:23,849 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:43:23,849 INFO ]: Start isEmpty. Operand 77 states and 187 transitions. [2018-06-22 11:43:23,850 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:23,850 INFO ]: Found error trace [2018-06-22 11:43:23,850 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:23,850 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:23,850 INFO ]: Analyzing trace with hash 74708302, now seen corresponding path program 1 times [2018-06-22 11:43:23,850 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:23,850 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:23,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:23,853 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:23,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:23,859 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:23,918 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:43:23,918 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:23,918 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 11:43:23,929 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:23,942 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:23,944 INFO ]: Computing forward predicates... [2018-06-22 11:43:24,258 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:43:24,290 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:24,290 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 11:43:24,291 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:43:24,291 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:43:24,291 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:24,291 INFO ]: Start difference. First operand 77 states and 187 transitions. Second operand 9 states. [2018-06-22 11:43:24,495 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:24,495 INFO ]: Finished difference Result 91 states and 231 transitions. [2018-06-22 11:43:24,502 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:43:24,502 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 11:43:24,502 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:24,503 INFO ]: With dead ends: 91 [2018-06-22 11:43:24,503 INFO ]: Without dead ends: 91 [2018-06-22 11:43:24,503 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:43:24,503 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 11:43:24,510 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 83. [2018-06-22 11:43:24,510 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 11:43:24,511 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 207 transitions. [2018-06-22 11:43:24,511 INFO ]: Start accepts. Automaton has 83 states and 207 transitions. Word has length 21 [2018-06-22 11:43:24,511 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:24,511 INFO ]: Abstraction has 83 states and 207 transitions. [2018-06-22 11:43:24,511 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:43:24,511 INFO ]: Start isEmpty. Operand 83 states and 207 transitions. [2018-06-22 11:43:24,512 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:43:24,512 INFO ]: Found error trace [2018-06-22 11:43:24,512 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:24,513 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:24,513 INFO ]: Analyzing trace with hash -1611177731, now seen corresponding path program 1 times [2018-06-22 11:43:24,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:24,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:24,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:24,513 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:24,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:24,520 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:24,605 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:43:24,605 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:24,605 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:43:24,606 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:43:24,606 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:43:24,606 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:24,606 INFO ]: Start difference. First operand 83 states and 207 transitions. Second operand 6 states. [2018-06-22 11:43:24,682 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:24,682 INFO ]: Finished difference Result 87 states and 226 transitions. [2018-06-22 11:43:24,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:43:24,683 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:43:24,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:24,684 INFO ]: With dead ends: 87 [2018-06-22 11:43:24,684 INFO ]: Without dead ends: 87 [2018-06-22 11:43:24,684 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:43:24,684 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 11:43:24,691 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 79. [2018-06-22 11:43:24,691 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:43:24,692 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 194 transitions. [2018-06-22 11:43:24,692 INFO ]: Start accepts. Automaton has 79 states and 194 transitions. Word has length 21 [2018-06-22 11:43:24,692 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:24,692 INFO ]: Abstraction has 79 states and 194 transitions. [2018-06-22 11:43:24,692 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:43:24,692 INFO ]: Start isEmpty. Operand 79 states and 194 transitions. [2018-06-22 11:43:24,693 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:43:24,693 INFO ]: Found error trace [2018-06-22 11:43:24,693 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:24,693 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:24,693 INFO ]: Analyzing trace with hash -1288531939, now seen corresponding path program 2 times [2018-06-22 11:43:24,694 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:24,694 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:24,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:24,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:24,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:24,700 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:25,007 INFO ]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:25,007 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:25,007 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 11:43:25,013 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:43:25,040 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:43:25,040 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:25,042 INFO ]: Computing forward predicates... [2018-06-22 11:43:25,057 INFO ]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:25,075 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:25,075 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:43:25,076 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:43:25,076 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:43:25,076 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:43:25,076 INFO ]: Start difference. First operand 79 states and 194 transitions. Second operand 10 states. [2018-06-22 11:43:25,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:25,629 INFO ]: Finished difference Result 103 states and 273 transitions. [2018-06-22 11:43:25,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:25,630 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-22 11:43:25,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:25,631 INFO ]: With dead ends: 103 [2018-06-22 11:43:25,631 INFO ]: Without dead ends: 103 [2018-06-22 11:43:25,631 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:43:25,631 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 11:43:25,639 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-06-22 11:43:25,639 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 11:43:25,640 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 217 transitions. [2018-06-22 11:43:25,640 INFO ]: Start accepts. Automaton has 87 states and 217 transitions. Word has length 25 [2018-06-22 11:43:25,640 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:25,640 INFO ]: Abstraction has 87 states and 217 transitions. [2018-06-22 11:43:25,640 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:43:25,640 INFO ]: Start isEmpty. Operand 87 states and 217 transitions. [2018-06-22 11:43:25,641 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:43:25,641 INFO ]: Found error trace [2018-06-22 11:43:25,641 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:25,641 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:25,641 INFO ]: Analyzing trace with hash -1260247415, now seen corresponding path program 2 times [2018-06-22 11:43:25,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:25,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:25,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:25,642 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:25,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:25,649 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:25,745 INFO ]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:25,745 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:25,745 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 11:43:25,756 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:43:25,775 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:43:25,775 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:25,777 INFO ]: Computing forward predicates... [2018-06-22 11:43:25,801 INFO ]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:25,820 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:25,820 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:43:25,820 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:43:25,820 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:43:25,820 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:43:25,821 INFO ]: Start difference. First operand 87 states and 217 transitions. Second operand 10 states. [2018-06-22 11:43:26,112 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:26,112 INFO ]: Finished difference Result 113 states and 309 transitions. [2018-06-22 11:43:26,112 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:26,112 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-22 11:43:26,112 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:26,113 INFO ]: With dead ends: 113 [2018-06-22 11:43:26,113 INFO ]: Without dead ends: 113 [2018-06-22 11:43:26,113 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:43:26,114 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-22 11:43:26,122 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 91. [2018-06-22 11:43:26,122 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 11:43:26,123 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 239 transitions. [2018-06-22 11:43:26,123 INFO ]: Start accepts. Automaton has 91 states and 239 transitions. Word has length 25 [2018-06-22 11:43:26,123 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:26,123 INFO ]: Abstraction has 91 states and 239 transitions. [2018-06-22 11:43:26,123 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:43:26,123 INFO ]: Start isEmpty. Operand 91 states and 239 transitions. [2018-06-22 11:43:26,125 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:43:26,125 INFO ]: Found error trace [2018-06-22 11:43:26,125 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:26,125 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:26,125 INFO ]: Analyzing trace with hash 1436227093, now seen corresponding path program 1 times [2018-06-22 11:43:26,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:26,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:26,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:26,126 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:26,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:26,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:26,356 INFO ]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:26,356 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:26,356 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 11:43:26,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:26,379 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:26,381 INFO ]: Computing forward predicates... [2018-06-22 11:43:26,490 INFO ]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:26,512 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:26,512 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 11:43:26,512 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:43:26,512 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:43:26,512 INFO ]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:43:26,513 INFO ]: Start difference. First operand 91 states and 239 transitions. Second operand 18 states. [2018-06-22 11:43:27,816 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:27,816 INFO ]: Finished difference Result 159 states and 490 transitions. [2018-06-22 11:43:27,816 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:43:27,816 INFO ]: Start accepts. Automaton has 18 states. Word has length 25 [2018-06-22 11:43:27,817 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:27,818 INFO ]: With dead ends: 159 [2018-06-22 11:43:27,818 INFO ]: Without dead ends: 159 [2018-06-22 11:43:27,818 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:43:27,819 INFO ]: Start minimizeSevpa. Operand 159 states. [2018-06-22 11:43:27,834 INFO ]: Finished minimizeSevpa. Reduced states from 159 to 91. [2018-06-22 11:43:27,834 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 11:43:27,835 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 238 transitions. [2018-06-22 11:43:27,835 INFO ]: Start accepts. Automaton has 91 states and 238 transitions. Word has length 25 [2018-06-22 11:43:27,835 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:27,835 INFO ]: Abstraction has 91 states and 238 transitions. [2018-06-22 11:43:27,835 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:43:27,836 INFO ]: Start isEmpty. Operand 91 states and 238 transitions. [2018-06-22 11:43:27,837 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:43:27,837 INFO ]: Found error trace [2018-06-22 11:43:27,837 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:27,837 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:27,837 INFO ]: Analyzing trace with hash 1360911234, now seen corresponding path program 1 times [2018-06-22 11:43:27,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:27,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:27,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:27,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:27,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:27,853 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:28,110 INFO ]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:28,110 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:28,110 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 11:43:28,121 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:28,135 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:28,138 INFO ]: Computing forward predicates... [2018-06-22 11:43:28,234 INFO ]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:28,253 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:28,253 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 11:43:28,253 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:43:28,254 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:43:28,254 INFO ]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:43:28,254 INFO ]: Start difference. First operand 91 states and 238 transitions. Second operand 18 states. [2018-06-22 11:43:29,125 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:29,125 INFO ]: Finished difference Result 159 states and 494 transitions. [2018-06-22 11:43:29,125 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:43:29,125 INFO ]: Start accepts. Automaton has 18 states. Word has length 25 [2018-06-22 11:43:29,125 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:29,127 INFO ]: With dead ends: 159 [2018-06-22 11:43:29,127 INFO ]: Without dead ends: 159 [2018-06-22 11:43:29,127 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:43:29,127 INFO ]: Start minimizeSevpa. Operand 159 states. [2018-06-22 11:43:29,141 INFO ]: Finished minimizeSevpa. Reduced states from 159 to 99. [2018-06-22 11:43:29,141 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-22 11:43:29,142 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 265 transitions. [2018-06-22 11:43:29,142 INFO ]: Start accepts. Automaton has 99 states and 265 transitions. Word has length 25 [2018-06-22 11:43:29,142 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:29,142 INFO ]: Abstraction has 99 states and 265 transitions. [2018-06-22 11:43:29,142 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:43:29,142 INFO ]: Start isEmpty. Operand 99 states and 265 transitions. [2018-06-22 11:43:29,144 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:43:29,144 INFO ]: Found error trace [2018-06-22 11:43:29,144 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:29,144 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:29,145 INFO ]: Analyzing trace with hash -479194448, now seen corresponding path program 1 times [2018-06-22 11:43:29,145 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:29,145 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:29,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:29,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:29,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:29,153 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:29,457 WARN ]: Spent 187.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-06-22 11:43:29,552 INFO ]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:43:29,552 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:29,553 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 11:43:29,553 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:43:29,553 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:43:29,553 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:29,553 INFO ]: Start difference. First operand 99 states and 265 transitions. Second operand 9 states. [2018-06-22 11:43:30,625 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:30,625 INFO ]: Finished difference Result 165 states and 551 transitions. [2018-06-22 11:43:30,625 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:43:30,625 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 11:43:30,625 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:30,627 INFO ]: With dead ends: 165 [2018-06-22 11:43:30,627 INFO ]: Without dead ends: 165 [2018-06-22 11:43:30,627 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:43:30,627 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-22 11:43:30,647 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 107. [2018-06-22 11:43:30,647 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 11:43:30,648 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 301 transitions. [2018-06-22 11:43:30,648 INFO ]: Start accepts. Automaton has 107 states and 301 transitions. Word has length 25 [2018-06-22 11:43:30,648 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:30,648 INFO ]: Abstraction has 107 states and 301 transitions. [2018-06-22 11:43:30,648 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:43:30,648 INFO ]: Start isEmpty. Operand 107 states and 301 transitions. [2018-06-22 11:43:30,649 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:43:30,649 INFO ]: Found error trace [2018-06-22 11:43:30,649 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:30,650 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:30,651 INFO ]: Analyzing trace with hash 1513062301, now seen corresponding path program 1 times [2018-06-22 11:43:30,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:30,652 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:30,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:30,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:30,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:30,660 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:30,966 WARN ]: Spent 191.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-06-22 11:43:31,064 INFO ]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:43:31,064 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:31,064 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 11:43:31,064 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:43:31,064 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:43:31,064 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:31,064 INFO ]: Start difference. First operand 107 states and 301 transitions. Second operand 9 states. [2018-06-22 11:43:31,487 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:31,487 INFO ]: Finished difference Result 165 states and 539 transitions. [2018-06-22 11:43:31,488 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:43:31,488 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 11:43:31,488 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:31,489 INFO ]: With dead ends: 165 [2018-06-22 11:43:31,489 INFO ]: Without dead ends: 165 [2018-06-22 11:43:31,490 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:43:31,490 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-22 11:43:31,507 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 107. [2018-06-22 11:43:31,507 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 11:43:31,509 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 297 transitions. [2018-06-22 11:43:31,509 INFO ]: Start accepts. Automaton has 107 states and 297 transitions. Word has length 25 [2018-06-22 11:43:31,509 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:31,509 INFO ]: Abstraction has 107 states and 297 transitions. [2018-06-22 11:43:31,509 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:43:31,509 INFO ]: Start isEmpty. Operand 107 states and 297 transitions. [2018-06-22 11:43:31,510 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:43:31,510 INFO ]: Found error trace [2018-06-22 11:43:31,510 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:31,510 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:31,511 INFO ]: Analyzing trace with hash -793643545, now seen corresponding path program 1 times [2018-06-22 11:43:31,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:31,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:31,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:31,511 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:31,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:31,519 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:31,764 INFO ]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:31,764 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:31,764 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 11:43:31,769 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:31,784 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:31,786 INFO ]: Computing forward predicates... [2018-06-22 11:43:31,807 INFO ]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:31,825 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:31,825 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:43:31,826 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:43:31,826 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:43:31,826 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:43:31,826 INFO ]: Start difference. First operand 107 states and 297 transitions. Second operand 10 states. [2018-06-22 11:43:32,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:32,055 INFO ]: Finished difference Result 143 states and 428 transitions. [2018-06-22 11:43:32,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:32,055 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-22 11:43:32,055 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:32,056 INFO ]: With dead ends: 143 [2018-06-22 11:43:32,056 INFO ]: Without dead ends: 143 [2018-06-22 11:43:32,056 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:43:32,056 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-22 11:43:32,068 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 87. [2018-06-22 11:43:32,068 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 11:43:32,069 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 226 transitions. [2018-06-22 11:43:32,069 INFO ]: Start accepts. Automaton has 87 states and 226 transitions. Word has length 25 [2018-06-22 11:43:32,070 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:32,070 INFO ]: Abstraction has 87 states and 226 transitions. [2018-06-22 11:43:32,070 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:43:32,070 INFO ]: Start isEmpty. Operand 87 states and 226 transitions. [2018-06-22 11:43:32,071 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:43:32,071 INFO ]: Found error trace [2018-06-22 11:43:32,071 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:32,071 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:32,071 INFO ]: Analyzing trace with hash -655634740, now seen corresponding path program 1 times [2018-06-22 11:43:32,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:32,071 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:32,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:32,071 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:32,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:32,080 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:32,239 INFO ]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:43:32,239 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:32,239 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 11:43:32,239 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:43:32,240 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:43:32,240 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:32,240 INFO ]: Start difference. First operand 87 states and 226 transitions. Second operand 9 states. [2018-06-22 11:43:32,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:32,522 INFO ]: Finished difference Result 125 states and 378 transitions. [2018-06-22 11:43:32,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:43:32,526 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 11:43:32,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:32,527 INFO ]: With dead ends: 125 [2018-06-22 11:43:32,527 INFO ]: Without dead ends: 125 [2018-06-22 11:43:32,528 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:43:32,528 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-22 11:43:32,539 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 87. [2018-06-22 11:43:32,539 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 11:43:32,540 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 224 transitions. [2018-06-22 11:43:32,540 INFO ]: Start accepts. Automaton has 87 states and 224 transitions. Word has length 25 [2018-06-22 11:43:32,540 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:32,540 INFO ]: Abstraction has 87 states and 224 transitions. [2018-06-22 11:43:32,540 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:43:32,540 INFO ]: Start isEmpty. Operand 87 states and 224 transitions. [2018-06-22 11:43:32,541 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:43:32,541 INFO ]: Found error trace [2018-06-22 11:43:32,541 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:32,541 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:32,541 INFO ]: Analyzing trace with hash -627350216, now seen corresponding path program 1 times [2018-06-22 11:43:32,541 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:32,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:32,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:32,542 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:32,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:32,549 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:32,676 INFO ]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:43:32,676 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:43:32,676 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-06-22 11:43:32,676 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:43:32,676 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:43:32,676 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:43:32,676 INFO ]: Start difference. First operand 87 states and 224 transitions. Second operand 9 states. [2018-06-22 11:43:32,963 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:32,963 INFO ]: Finished difference Result 125 states and 372 transitions. [2018-06-22 11:43:32,964 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:43:32,964 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 11:43:32,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:32,965 INFO ]: With dead ends: 125 [2018-06-22 11:43:32,965 INFO ]: Without dead ends: 125 [2018-06-22 11:43:32,965 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:43:32,965 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-22 11:43:32,971 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 77. [2018-06-22 11:43:32,971 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:43:32,972 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 192 transitions. [2018-06-22 11:43:32,972 INFO ]: Start accepts. Automaton has 77 states and 192 transitions. Word has length 25 [2018-06-22 11:43:32,972 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:32,972 INFO ]: Abstraction has 77 states and 192 transitions. [2018-06-22 11:43:32,972 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:43:32,972 INFO ]: Start isEmpty. Operand 77 states and 192 transitions. [2018-06-22 11:43:32,973 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:43:32,973 INFO ]: Found error trace [2018-06-22 11:43:32,973 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:32,973 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:32,973 INFO ]: Analyzing trace with hash -1367667837, now seen corresponding path program 1 times [2018-06-22 11:43:32,973 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:32,973 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:32,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:32,974 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:32,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:32,980 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:33,752 INFO ]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:33,752 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:33,752 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 11:43:33,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:33,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:33,772 INFO ]: Computing forward predicates... [2018-06-22 11:43:33,805 INFO ]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:33,831 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:33,831 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:43:33,831 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:43:33,831 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:43:33,831 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:43:33,831 INFO ]: Start difference. First operand 77 states and 192 transitions. Second operand 10 states. [2018-06-22 11:43:34,110 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:34,110 INFO ]: Finished difference Result 103 states and 286 transitions. [2018-06-22 11:43:34,110 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:43:34,110 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-22 11:43:34,110 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:34,111 INFO ]: With dead ends: 103 [2018-06-22 11:43:34,111 INFO ]: Without dead ends: 103 [2018-06-22 11:43:34,111 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:43:34,111 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 11:43:34,117 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 77. [2018-06-22 11:43:34,117 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:43:34,117 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 192 transitions. [2018-06-22 11:43:34,118 INFO ]: Start accepts. Automaton has 77 states and 192 transitions. Word has length 25 [2018-06-22 11:43:34,118 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:34,118 INFO ]: Abstraction has 77 states and 192 transitions. [2018-06-22 11:43:34,118 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:43:34,118 INFO ]: Start isEmpty. Operand 77 states and 192 transitions. [2018-06-22 11:43:34,118 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:43:34,118 INFO ]: Found error trace [2018-06-22 11:43:34,119 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:34,119 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:34,119 INFO ]: Analyzing trace with hash -1937872090, now seen corresponding path program 1 times [2018-06-22 11:43:34,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:34,119 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:34,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:34,119 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:34,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:34,126 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:34,349 INFO ]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:34,349 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:34,349 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 11:43:34,354 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:34,369 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:34,370 INFO ]: Computing forward predicates... [2018-06-22 11:43:34,399 INFO ]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:34,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:34,423 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:43:34,423 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:43:34,424 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:43:34,424 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:43:34,424 INFO ]: Start difference. First operand 77 states and 192 transitions. Second operand 10 states. [2018-06-22 11:43:34,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:34,747 INFO ]: Finished difference Result 131 states and 393 transitions. [2018-06-22 11:43:34,749 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:43:34,749 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-22 11:43:34,749 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:34,751 INFO ]: With dead ends: 131 [2018-06-22 11:43:34,751 INFO ]: Without dead ends: 131 [2018-06-22 11:43:34,751 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:43:34,751 INFO ]: Start minimizeSevpa. Operand 131 states. [2018-06-22 11:43:34,761 INFO ]: Finished minimizeSevpa. Reduced states from 131 to 75. [2018-06-22 11:43:34,761 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:43:34,762 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 189 transitions. [2018-06-22 11:43:34,762 INFO ]: Start accepts. Automaton has 75 states and 189 transitions. Word has length 25 [2018-06-22 11:43:34,763 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:34,763 INFO ]: Abstraction has 75 states and 189 transitions. [2018-06-22 11:43:34,763 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:43:34,763 INFO ]: Start isEmpty. Operand 75 states and 189 transitions. [2018-06-22 11:43:34,766 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:43:34,766 INFO ]: Found error trace [2018-06-22 11:43:34,766 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:34,766 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:34,766 INFO ]: Analyzing trace with hash -1442983696, now seen corresponding path program 1 times [2018-06-22 11:43:34,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:34,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:34,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:34,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:34,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:34,773 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:35,590 INFO ]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:35,590 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:35,590 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:35,599 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:35,614 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:35,616 INFO ]: Computing forward predicates... [2018-06-22 11:43:35,629 INFO ]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:43:35,649 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:35,649 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:43:35,649 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:43:35,649 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:43:35,649 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:43:35,649 INFO ]: Start difference. First operand 75 states and 189 transitions. Second operand 10 states. [2018-06-22 11:43:35,920 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:35,920 INFO ]: Finished difference Result 115 states and 340 transitions. [2018-06-22 11:43:35,920 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:43:35,920 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-22 11:43:35,921 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:35,922 INFO ]: With dead ends: 115 [2018-06-22 11:43:35,922 INFO ]: Without dead ends: 115 [2018-06-22 11:43:35,922 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:43:35,922 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-22 11:43:35,930 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 65. [2018-06-22 11:43:35,930 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:43:35,931 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 154 transitions. [2018-06-22 11:43:35,931 INFO ]: Start accepts. Automaton has 65 states and 154 transitions. Word has length 25 [2018-06-22 11:43:35,931 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:35,931 INFO ]: Abstraction has 65 states and 154 transitions. [2018-06-22 11:43:35,931 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:43:35,931 INFO ]: Start isEmpty. Operand 65 states and 154 transitions. [2018-06-22 11:43:35,932 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:43:35,932 INFO ]: Found error trace [2018-06-22 11:43:35,932 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:35,932 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:35,932 INFO ]: Analyzing trace with hash -346390017, now seen corresponding path program 1 times [2018-06-22 11:43:35,932 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:35,932 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:35,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:35,932 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:35,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:35,941 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:36,297 INFO ]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:36,297 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:36,297 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:36,302 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:36,320 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:36,322 INFO ]: Computing forward predicates... [2018-06-22 11:43:36,355 INFO ]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:36,376 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:36,376 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 11:43:36,376 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:43:36,376 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:43:36,376 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:43:36,376 INFO ]: Start difference. First operand 65 states and 154 transitions. Second operand 13 states. [2018-06-22 11:43:36,936 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:36,936 INFO ]: Finished difference Result 150 states and 436 transitions. [2018-06-22 11:43:36,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:43:36,936 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 11:43:36,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:36,941 INFO ]: With dead ends: 150 [2018-06-22 11:43:36,941 INFO ]: Without dead ends: 150 [2018-06-22 11:43:36,941 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:43:36,942 INFO ]: Start minimizeSevpa. Operand 150 states. [2018-06-22 11:43:36,951 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 100. [2018-06-22 11:43:36,951 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 11:43:36,952 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 248 transitions. [2018-06-22 11:43:36,952 INFO ]: Start accepts. Automaton has 100 states and 248 transitions. Word has length 29 [2018-06-22 11:43:36,952 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:36,952 INFO ]: Abstraction has 100 states and 248 transitions. [2018-06-22 11:43:36,952 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:43:36,952 INFO ]: Start isEmpty. Operand 100 states and 248 transitions. [2018-06-22 11:43:36,953 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:43:36,953 INFO ]: Found error trace [2018-06-22 11:43:36,953 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:36,953 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:36,954 INFO ]: Analyzing trace with hash -105619210, now seen corresponding path program 1 times [2018-06-22 11:43:36,954 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:36,954 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:36,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:36,954 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:36,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:36,961 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:37,112 INFO ]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:37,112 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:37,112 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:37,120 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:37,137 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:37,139 INFO ]: Computing forward predicates... [2018-06-22 11:43:37,244 INFO ]: Checked inductivity of 23 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:37,264 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:37,264 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-22 11:43:37,265 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:43:37,265 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:43:37,265 INFO ]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:43:37,265 INFO ]: Start difference. First operand 100 states and 248 transitions. Second operand 20 states. [2018-06-22 11:43:38,341 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:38,341 INFO ]: Finished difference Result 174 states and 509 transitions. [2018-06-22 11:43:38,341 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:43:38,341 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:43:38,341 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:38,342 INFO ]: With dead ends: 174 [2018-06-22 11:43:38,342 INFO ]: Without dead ends: 174 [2018-06-22 11:43:38,343 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=350, Invalid=1720, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:43:38,343 INFO ]: Start minimizeSevpa. Operand 174 states. [2018-06-22 11:43:38,350 INFO ]: Finished minimizeSevpa. Reduced states from 174 to 106. [2018-06-22 11:43:38,350 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-22 11:43:38,350 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 255 transitions. [2018-06-22 11:43:38,350 INFO ]: Start accepts. Automaton has 106 states and 255 transitions. Word has length 29 [2018-06-22 11:43:38,351 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:38,351 INFO ]: Abstraction has 106 states and 255 transitions. [2018-06-22 11:43:38,351 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:43:38,351 INFO ]: Start isEmpty. Operand 106 states and 255 transitions. [2018-06-22 11:43:38,352 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:43:38,352 INFO ]: Found error trace [2018-06-22 11:43:38,352 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:38,352 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:38,352 INFO ]: Analyzing trace with hash 297382263, now seen corresponding path program 1 times [2018-06-22 11:43:38,352 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:38,352 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:38,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:38,352 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:38,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:38,360 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:39,037 INFO ]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:39,037 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:39,037 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:39,043 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:39,072 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:39,074 INFO ]: Computing forward predicates... [2018-06-22 11:43:39,250 INFO ]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:39,269 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:39,269 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 11:43:39,269 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:43:39,269 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:43:39,269 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:43:39,269 INFO ]: Start difference. First operand 106 states and 255 transitions. Second operand 13 states. [2018-06-22 11:43:39,761 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:39,761 INFO ]: Finished difference Result 156 states and 456 transitions. [2018-06-22 11:43:39,761 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:43:39,762 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 11:43:39,762 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:39,763 INFO ]: With dead ends: 156 [2018-06-22 11:43:39,763 INFO ]: Without dead ends: 156 [2018-06-22 11:43:39,763 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:43:39,763 INFO ]: Start minimizeSevpa. Operand 156 states. [2018-06-22 11:43:39,773 INFO ]: Finished minimizeSevpa. Reduced states from 156 to 108. [2018-06-22 11:43:39,773 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 11:43:39,774 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 266 transitions. [2018-06-22 11:43:39,774 INFO ]: Start accepts. Automaton has 108 states and 266 transitions. Word has length 29 [2018-06-22 11:43:39,774 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:39,774 INFO ]: Abstraction has 108 states and 266 transitions. [2018-06-22 11:43:39,774 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:43:39,774 INFO ]: Start isEmpty. Operand 108 states and 266 transitions. [2018-06-22 11:43:39,775 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:43:39,775 INFO ]: Found error trace [2018-06-22 11:43:39,775 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:39,775 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:39,775 INFO ]: Analyzing trace with hash 2134061796, now seen corresponding path program 1 times [2018-06-22 11:43:39,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:39,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:39,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:39,776 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:39,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:39,784 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:40,141 INFO ]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:40,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:40,141 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:40,146 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:40,163 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:40,164 INFO ]: Computing forward predicates... [2018-06-22 11:43:40,287 INFO ]: Checked inductivity of 22 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:40,306 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:40,306 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-22 11:43:40,306 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:43:40,306 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:43:40,306 INFO ]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:43:40,306 INFO ]: Start difference. First operand 108 states and 266 transitions. Second operand 20 states. [2018-06-22 11:43:41,409 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:41,409 INFO ]: Finished difference Result 166 states and 478 transitions. [2018-06-22 11:43:41,409 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:43:41,409 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:43:41,409 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:41,411 INFO ]: With dead ends: 166 [2018-06-22 11:43:41,411 INFO ]: Without dead ends: 166 [2018-06-22 11:43:41,411 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:43:41,412 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-22 11:43:41,423 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 100. [2018-06-22 11:43:41,423 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 11:43:41,424 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 241 transitions. [2018-06-22 11:43:41,424 INFO ]: Start accepts. Automaton has 100 states and 241 transitions. Word has length 29 [2018-06-22 11:43:41,424 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:41,424 INFO ]: Abstraction has 100 states and 241 transitions. [2018-06-22 11:43:41,424 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:43:41,424 INFO ]: Start isEmpty. Operand 100 states and 241 transitions. [2018-06-22 11:43:41,425 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:43:41,425 INFO ]: Found error trace [2018-06-22 11:43:41,425 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:41,425 INFO ]: === Iteration 56 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:41,426 INFO ]: Analyzing trace with hash 1935098580, now seen corresponding path program 1 times [2018-06-22 11:43:41,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:41,426 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:41,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:41,426 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:41,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:41,434 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:41,682 INFO ]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:41,682 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:41,682 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:41,688 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:41,705 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:41,707 INFO ]: Computing forward predicates... [2018-06-22 11:43:41,742 INFO ]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:41,772 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:41,772 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 11:43:41,772 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:43:41,772 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:43:41,772 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:43:41,772 INFO ]: Start difference. First operand 100 states and 241 transitions. Second operand 13 states. [2018-06-22 11:43:42,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:42,305 INFO ]: Finished difference Result 134 states and 365 transitions. [2018-06-22 11:43:42,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:43:42,306 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 11:43:42,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:42,307 INFO ]: With dead ends: 134 [2018-06-22 11:43:42,307 INFO ]: Without dead ends: 134 [2018-06-22 11:43:42,307 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:43:42,307 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-22 11:43:42,314 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 102. [2018-06-22 11:43:42,314 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 11:43:42,314 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 251 transitions. [2018-06-22 11:43:42,315 INFO ]: Start accepts. Automaton has 102 states and 251 transitions. Word has length 29 [2018-06-22 11:43:42,315 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:42,315 INFO ]: Abstraction has 102 states and 251 transitions. [2018-06-22 11:43:42,315 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:43:42,315 INFO ]: Start isEmpty. Operand 102 states and 251 transitions. [2018-06-22 11:43:42,316 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:43:42,316 INFO ]: Found error trace [2018-06-22 11:43:42,316 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:42,316 INFO ]: === Iteration 57 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:42,316 INFO ]: Analyzing trace with hash 2139894407, now seen corresponding path program 1 times [2018-06-22 11:43:42,316 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:42,316 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:42,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:42,316 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:42,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:42,325 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:42,412 INFO ]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:42,412 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:42,412 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:42,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:42,436 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:42,437 INFO ]: Computing forward predicates... [2018-06-22 11:43:42,474 INFO ]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:42,505 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:42,505 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 11:43:42,505 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:43:42,505 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:43:42,505 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:43:42,505 INFO ]: Start difference. First operand 102 states and 251 transitions. Second operand 13 states. [2018-06-22 11:43:43,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:43,085 INFO ]: Finished difference Result 144 states and 415 transitions. [2018-06-22 11:43:43,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:43:43,085 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 11:43:43,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:43,086 INFO ]: With dead ends: 144 [2018-06-22 11:43:43,086 INFO ]: Without dead ends: 144 [2018-06-22 11:43:43,086 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:43:43,086 INFO ]: Start minimizeSevpa. Operand 144 states. [2018-06-22 11:43:43,092 INFO ]: Finished minimizeSevpa. Reduced states from 144 to 102. [2018-06-22 11:43:43,092 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 11:43:43,093 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 250 transitions. [2018-06-22 11:43:43,093 INFO ]: Start accepts. Automaton has 102 states and 250 transitions. Word has length 29 [2018-06-22 11:43:43,093 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:43,093 INFO ]: Abstraction has 102 states and 250 transitions. [2018-06-22 11:43:43,093 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:43:43,093 INFO ]: Start isEmpty. Operand 102 states and 250 transitions. [2018-06-22 11:43:43,094 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:43:43,094 INFO ]: Found error trace [2018-06-22 11:43:43,094 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:43,095 INFO ]: === Iteration 58 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:43,095 INFO ]: Analyzing trace with hash 1137383569, now seen corresponding path program 1 times [2018-06-22 11:43:43,095 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:43,095 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:43,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:43,095 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:43,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:43,103 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:43,651 INFO ]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:43,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:43,651 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:43,657 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:43,673 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:43,674 INFO ]: Computing forward predicates... [2018-06-22 11:43:43,771 INFO ]: Checked inductivity of 22 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:43,789 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:43,789 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-22 11:43:43,790 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:43:43,790 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:43:43,790 INFO ]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:43:43,790 INFO ]: Start difference. First operand 102 states and 250 transitions. Second operand 20 states. [2018-06-22 11:43:44,732 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:44,732 INFO ]: Finished difference Result 148 states and 435 transitions. [2018-06-22 11:43:44,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:43:44,732 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:43:44,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:44,733 INFO ]: With dead ends: 148 [2018-06-22 11:43:44,733 INFO ]: Without dead ends: 142 [2018-06-22 11:43:44,734 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=1431, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:43:44,734 INFO ]: Start minimizeSevpa. Operand 142 states. [2018-06-22 11:43:44,757 INFO ]: Finished minimizeSevpa. Reduced states from 142 to 96. [2018-06-22 11:43:44,757 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:43:44,758 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 238 transitions. [2018-06-22 11:43:44,758 INFO ]: Start accepts. Automaton has 96 states and 238 transitions. Word has length 29 [2018-06-22 11:43:44,758 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:44,758 INFO ]: Abstraction has 96 states and 238 transitions. [2018-06-22 11:43:44,758 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:43:44,758 INFO ]: Start isEmpty. Operand 96 states and 238 transitions. [2018-06-22 11:43:44,759 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:43:44,759 INFO ]: Found error trace [2018-06-22 11:43:44,759 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:44,759 INFO ]: === Iteration 59 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:44,760 INFO ]: Analyzing trace with hash 938420353, now seen corresponding path program 1 times [2018-06-22 11:43:44,760 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:44,760 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:44,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:44,760 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:44,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:44,767 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:45,065 INFO ]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:45,065 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:45,065 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:45,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:45,086 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:45,088 INFO ]: Computing forward predicates... [2018-06-22 11:43:45,126 INFO ]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:45,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:45,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 11:43:45,145 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:43:45,145 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:43:45,145 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:43:45,145 INFO ]: Start difference. First operand 96 states and 238 transitions. Second operand 13 states. [2018-06-22 11:43:45,744 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:45,744 INFO ]: Finished difference Result 134 states and 379 transitions. [2018-06-22 11:43:45,744 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:43:45,744 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 11:43:45,744 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:45,745 INFO ]: With dead ends: 134 [2018-06-22 11:43:45,745 INFO ]: Without dead ends: 134 [2018-06-22 11:43:45,746 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:43:45,746 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-22 11:43:45,755 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-06-22 11:43:45,755 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:43:45,756 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 237 transitions. [2018-06-22 11:43:45,756 INFO ]: Start accepts. Automaton has 96 states and 237 transitions. Word has length 29 [2018-06-22 11:43:45,756 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:45,756 INFO ]: Abstraction has 96 states and 237 transitions. [2018-06-22 11:43:45,756 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:43:45,756 INFO ]: Start isEmpty. Operand 96 states and 237 transitions. [2018-06-22 11:43:45,757 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:43:45,757 INFO ]: Found error trace [2018-06-22 11:43:45,757 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:45,757 INFO ]: === Iteration 60 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:45,757 INFO ]: Analyzing trace with hash 1644232247, now seen corresponding path program 2 times [2018-06-22 11:43:45,757 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:45,757 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:45,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:45,758 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:45,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:45,763 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:45,849 INFO ]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:45,849 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:45,849 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:45,854 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:43:45,871 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:43:45,872 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:45,873 INFO ]: Computing forward predicates... [2018-06-22 11:43:45,981 INFO ]: Checked inductivity of 22 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:45,999 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:45,999 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-22 11:43:45,999 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:43:45,999 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:43:45,999 INFO ]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:43:46,000 INFO ]: Start difference. First operand 96 states and 237 transitions. Second operand 20 states. [2018-06-22 11:43:47,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:47,346 INFO ]: Finished difference Result 142 states and 398 transitions. [2018-06-22 11:43:47,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:43:47,346 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:43:47,347 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:47,347 INFO ]: With dead ends: 142 [2018-06-22 11:43:47,347 INFO ]: Without dead ends: 142 [2018-06-22 11:43:47,348 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=1233, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:43:47,348 INFO ]: Start minimizeSevpa. Operand 142 states. [2018-06-22 11:43:47,357 INFO ]: Finished minimizeSevpa. Reduced states from 142 to 104. [2018-06-22 11:43:47,357 INFO ]: Start removeUnreachable. Operand 104 states. [2018-06-22 11:43:47,358 INFO ]: Finished removeUnreachable. Reduced from 104 states to 104 states and 256 transitions. [2018-06-22 11:43:47,358 INFO ]: Start accepts. Automaton has 104 states and 256 transitions. Word has length 29 [2018-06-22 11:43:47,358 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:47,358 INFO ]: Abstraction has 104 states and 256 transitions. [2018-06-22 11:43:47,358 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:43:47,358 INFO ]: Start isEmpty. Operand 104 states and 256 transitions. [2018-06-22 11:43:47,359 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:43:47,359 INFO ]: Found error trace [2018-06-22 11:43:47,359 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:47,359 INFO ]: === Iteration 61 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:47,359 INFO ]: Analyzing trace with hash 826285213, now seen corresponding path program 1 times [2018-06-22 11:43:47,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:47,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:47,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:47,360 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:47,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:47,367 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:47,477 INFO ]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:47,477 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:47,477 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:47,482 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:47,498 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:47,500 INFO ]: Computing forward predicates... [2018-06-22 11:43:48,080 INFO ]: Checked inductivity of 22 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:43:48,098 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:48,098 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-22 11:43:48,098 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:43:48,098 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:43:48,098 INFO ]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:43:48,099 INFO ]: Start difference. First operand 104 states and 256 transitions. Second operand 20 states. [2018-06-22 11:43:49,216 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:49,216 INFO ]: Finished difference Result 144 states and 416 transitions. [2018-06-22 11:43:49,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:43:49,216 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:43:49,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:49,217 INFO ]: With dead ends: 144 [2018-06-22 11:43:49,217 INFO ]: Without dead ends: 138 [2018-06-22 11:43:49,217 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=1172, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:43:49,217 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-22 11:43:49,226 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 96. [2018-06-22 11:43:49,226 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 11:43:49,226 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 227 transitions. [2018-06-22 11:43:49,226 INFO ]: Start accepts. Automaton has 96 states and 227 transitions. Word has length 29 [2018-06-22 11:43:49,226 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:49,227 INFO ]: Abstraction has 96 states and 227 transitions. [2018-06-22 11:43:49,227 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:43:49,227 INFO ]: Start isEmpty. Operand 96 states and 227 transitions. [2018-06-22 11:43:49,227 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:43:49,227 INFO ]: Found error trace [2018-06-22 11:43:49,227 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:49,227 INFO ]: === Iteration 62 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:49,228 INFO ]: Analyzing trace with hash -1002686109, now seen corresponding path program 2 times [2018-06-22 11:43:49,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:49,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:49,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:49,228 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:49,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:49,236 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:49,330 INFO ]: Checked inductivity of 35 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:43:49,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:49,330 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:49,340 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:43:49,361 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:43:49,361 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:49,364 INFO ]: Computing forward predicates... [2018-06-22 11:43:49,437 INFO ]: Checked inductivity of 35 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:43:49,468 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:49,468 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-22 11:43:49,469 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:43:49,469 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:43:49,469 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:43:49,469 INFO ]: Start difference. First operand 96 states and 227 transitions. Second operand 15 states. [2018-06-22 11:43:50,752 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:50,752 INFO ]: Finished difference Result 246 states and 753 transitions. [2018-06-22 11:43:50,753 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 11:43:50,753 INFO ]: Start accepts. Automaton has 15 states. Word has length 33 [2018-06-22 11:43:50,753 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:50,756 INFO ]: With dead ends: 246 [2018-06-22 11:43:50,756 INFO ]: Without dead ends: 240 [2018-06-22 11:43:50,757 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:43:50,759 INFO ]: Start minimizeSevpa. Operand 240 states. [2018-06-22 11:43:50,777 INFO ]: Finished minimizeSevpa. Reduced states from 240 to 128. [2018-06-22 11:43:50,777 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-22 11:43:50,778 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 351 transitions. [2018-06-22 11:43:50,778 INFO ]: Start accepts. Automaton has 128 states and 351 transitions. Word has length 33 [2018-06-22 11:43:50,778 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:50,778 INFO ]: Abstraction has 128 states and 351 transitions. [2018-06-22 11:43:50,778 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:43:50,778 INFO ]: Start isEmpty. Operand 128 states and 351 transitions. [2018-06-22 11:43:50,782 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:43:50,782 INFO ]: Found error trace [2018-06-22 11:43:50,782 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:50,782 INFO ]: === Iteration 63 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:50,782 INFO ]: Analyzing trace with hash -72479191, now seen corresponding path program 1 times [2018-06-22 11:43:50,782 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:50,782 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:50,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:50,782 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:50,782 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:50,790 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:50,933 INFO ]: Checked inductivity of 35 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:43:50,933 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:50,933 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:50,940 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:50,960 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:50,962 INFO ]: Computing forward predicates... [2018-06-22 11:43:50,988 INFO ]: Checked inductivity of 35 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:43:51,007 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:51,007 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-22 11:43:51,007 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:43:51,007 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:43:51,007 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:43:51,007 INFO ]: Start difference. First operand 128 states and 351 transitions. Second operand 15 states. [2018-06-22 11:43:51,937 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:51,937 INFO ]: Finished difference Result 384 states and 1368 transitions. [2018-06-22 11:43:51,937 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 11:43:51,937 INFO ]: Start accepts. Automaton has 15 states. Word has length 33 [2018-06-22 11:43:51,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:51,941 INFO ]: With dead ends: 384 [2018-06-22 11:43:51,941 INFO ]: Without dead ends: 380 [2018-06-22 11:43:51,941 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:43:51,941 INFO ]: Start minimizeSevpa. Operand 380 states. [2018-06-22 11:43:51,994 INFO ]: Finished minimizeSevpa. Reduced states from 380 to 226. [2018-06-22 11:43:51,994 INFO ]: Start removeUnreachable. Operand 226 states. [2018-06-22 11:43:51,996 INFO ]: Finished removeUnreachable. Reduced from 226 states to 226 states and 740 transitions. [2018-06-22 11:43:51,996 INFO ]: Start accepts. Automaton has 226 states and 740 transitions. Word has length 33 [2018-06-22 11:43:51,996 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:51,996 INFO ]: Abstraction has 226 states and 740 transitions. [2018-06-22 11:43:51,996 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:43:51,996 INFO ]: Start isEmpty. Operand 226 states and 740 transitions. [2018-06-22 11:43:51,999 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:43:51,999 INFO ]: Found error trace [2018-06-22 11:43:51,999 INFO ]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:51,999 INFO ]: === Iteration 64 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:51,999 INFO ]: Analyzing trace with hash -1285557428, now seen corresponding path program 1 times [2018-06-22 11:43:52,000 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:52,000 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:52,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:52,000 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:52,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:52,006 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:52,655 INFO ]: Checked inductivity of 37 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:43:52,655 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:52,655 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:52,661 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:52,680 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:52,681 INFO ]: Computing forward predicates... [2018-06-22 11:43:52,702 INFO ]: Checked inductivity of 37 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:43:52,720 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:52,720 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-22 11:43:52,720 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:43:52,720 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:43:52,720 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:43:52,720 INFO ]: Start difference. First operand 226 states and 740 transitions. Second operand 14 states. [2018-06-22 11:43:53,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:53,325 INFO ]: Finished difference Result 434 states and 1545 transitions. [2018-06-22 11:43:53,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:43:53,326 INFO ]: Start accepts. Automaton has 14 states. Word has length 33 [2018-06-22 11:43:53,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:53,330 INFO ]: With dead ends: 434 [2018-06-22 11:43:53,330 INFO ]: Without dead ends: 434 [2018-06-22 11:43:53,330 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:43:53,330 INFO ]: Start minimizeSevpa. Operand 434 states. [2018-06-22 11:43:53,376 INFO ]: Finished minimizeSevpa. Reduced states from 434 to 272. [2018-06-22 11:43:53,376 INFO ]: Start removeUnreachable. Operand 272 states. [2018-06-22 11:43:53,378 INFO ]: Finished removeUnreachable. Reduced from 272 states to 272 states and 888 transitions. [2018-06-22 11:43:53,379 INFO ]: Start accepts. Automaton has 272 states and 888 transitions. Word has length 33 [2018-06-22 11:43:53,379 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:53,379 INFO ]: Abstraction has 272 states and 888 transitions. [2018-06-22 11:43:53,379 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:43:53,379 INFO ]: Start isEmpty. Operand 272 states and 888 transitions. [2018-06-22 11:43:53,382 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:43:53,382 INFO ]: Found error trace [2018-06-22 11:43:53,382 INFO ]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:43:53,382 INFO ]: === Iteration 65 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:53,383 INFO ]: Analyzing trace with hash 991218043, now seen corresponding path program 2 times [2018-06-22 11:43:53,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:53,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:53,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:53,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:53,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:53,390 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:54,049 INFO ]: Checked inductivity of 37 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:43:54,049 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:54,049 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:54,056 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:43:54,077 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:43:54,077 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:54,079 INFO ]: Computing forward predicates... [2018-06-22 11:43:54,100 INFO ]: Checked inductivity of 37 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:43:54,119 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:54,119 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-22 11:43:54,119 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:43:54,119 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:43:54,119 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:43:54,119 INFO ]: Start difference. First operand 272 states and 888 transitions. Second operand 14 states. [2018-06-22 11:43:54,714 WARN ]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 11:43:54,988 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:43:54,988 INFO ]: Finished difference Result 392 states and 1483 transitions. [2018-06-22 11:43:54,988 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:43:54,988 INFO ]: Start accepts. Automaton has 14 states. Word has length 33 [2018-06-22 11:43:54,988 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:43:54,991 INFO ]: With dead ends: 392 [2018-06-22 11:43:54,991 INFO ]: Without dead ends: 392 [2018-06-22 11:43:54,991 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:43:54,991 INFO ]: Start minimizeSevpa. Operand 392 states. [2018-06-22 11:43:55,025 INFO ]: Finished minimizeSevpa. Reduced states from 392 to 266. [2018-06-22 11:43:55,025 INFO ]: Start removeUnreachable. Operand 266 states. [2018-06-22 11:43:55,027 INFO ]: Finished removeUnreachable. Reduced from 266 states to 266 states and 824 transitions. [2018-06-22 11:43:55,027 INFO ]: Start accepts. Automaton has 266 states and 824 transitions. Word has length 33 [2018-06-22 11:43:55,028 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:43:55,028 INFO ]: Abstraction has 266 states and 824 transitions. [2018-06-22 11:43:55,028 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:43:55,028 INFO ]: Start isEmpty. Operand 266 states and 824 transitions. [2018-06-22 11:43:55,031 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:43:55,031 INFO ]: Found error trace [2018-06-22 11:43:55,031 INFO ]: trace histogram [5, 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 11:43:55,031 INFO ]: === Iteration 66 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:43:55,031 INFO ]: Analyzing trace with hash -687486258, now seen corresponding path program 1 times [2018-06-22 11:43:55,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:43:55,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:43:55,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:55,031 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:43:55,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:43:55,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:55,283 INFO ]: Checked inductivity of 34 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:43:55,283 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:43:55,283 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:43:55,288 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:43:55,309 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:43:55,311 INFO ]: Computing forward predicates... [2018-06-22 11:43:55,341 INFO ]: Checked inductivity of 34 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:43:55,359 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:43:55,359 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-22 11:43:55,359 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:43:55,359 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:43:55,359 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:43:55,359 INFO ]: Start difference. First operand 266 states and 824 transitions. Second operand 15 states. Received shutdown request... [2018-06-22 11:43:55,826 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:43:55,826 WARN ]: Verification canceled [2018-06-22 11:43:55,831 WARN ]: Timeout [2018-06-22 11:43:55,832 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:43:55 BoogieIcfgContainer [2018-06-22 11:43:55,832 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:43:55,832 INFO ]: Toolchain (without parser) took 54160.52 ms. Allocated memory was 304.6 MB in the beginning and 759.2 MB in the end (delta: 454.6 MB). Free memory was 257.1 MB in the beginning and 427.1 MB in the end (delta: -169.9 MB). Peak memory consumption was 284.6 MB. Max. memory is 3.6 GB. [2018-06-22 11:43:55,833 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 304.6 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:43:55,833 INFO ]: ChcToBoogie took 53.85 ms. Allocated memory is still 304.6 MB. Free memory was 257.1 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:43:55,833 INFO ]: Boogie Preprocessor took 56.43 ms. Allocated memory is still 304.6 MB. Free memory was 255.2 MB in the beginning and 253.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:43:55,834 INFO ]: RCFGBuilder took 480.63 ms. Allocated memory is still 304.6 MB. Free memory was 253.2 MB in the beginning and 241.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:43:55,835 INFO ]: TraceAbstraction took 53560.49 ms. Allocated memory was 304.6 MB in the beginning and 759.2 MB in the end (delta: 454.6 MB). Free memory was 241.2 MB in the beginning and 427.1 MB in the end (delta: -185.9 MB). Peak memory consumption was 268.7 MB. Max. memory is 3.6 GB. [2018-06-22 11:43:55,836 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 304.6 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 53.85 ms. Allocated memory is still 304.6 MB. Free memory was 257.1 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 56.43 ms. Allocated memory is still 304.6 MB. Free memory was 255.2 MB in the beginning and 253.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 480.63 ms. Allocated memory is still 304.6 MB. Free memory was 253.2 MB in the beginning and 241.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 53560.49 ms. Allocated memory was 304.6 MB in the beginning and 759.2 MB in the end (delta: 454.6 MB). Free memory was 241.2 MB in the beginning and 427.1 MB in the end (delta: -185.9 MB). Peak memory consumption was 268.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (266states) and interpolant automaton (currently 30 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (88 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. TIMEOUT Result, 53.5s OverallTime, 66 OverallIterations, 5 TraceHistogramMax, 30.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2861 SDtfs, 732 SDslu, 14000 SDs, 0 SdLazy, 25757 SolverSat, 1890 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1828 GetRequests, 832 SyntacticMatches, 51 SemanticMatches, 945 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 3108 ImplicationChecksByTransitivity, 24.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=64, 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.7s AutomataMinimizationTime, 65 MinimizatonAttempts, 1844 StatesRemovedByMinimization, 64 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 2218 NumberOfCodeBlocks, 2218 NumberOfCodeBlocksAsserted, 99 NumberOfCheckSat, 2124 ConstructedInterpolants, 5 QuantifiedInterpolants, 194168 SizeOfPredicates, 173 NumberOfNonLiveVariables, 4641 ConjunctsInSsa, 431 ConjunctsInUnsatCore, 94 InterpolantComputations, 38 PerfectInterpolantSequences, 790/1292 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/heap__selsort.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-43-55-849.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/heap__selsort.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-43-55-849.csv Completed graceful shutdown