java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/008b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:23:32,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:23:32,099 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:23:32,110 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:23:32,111 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:23:32,112 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:23:32,113 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:23:32,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:23:32,122 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:23:32,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:23:32,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:23:32,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:23:32,128 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:23:32,130 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:23:32,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:23:32,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:23:32,135 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:23:32,137 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:23:32,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:23:32,152 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:23:32,153 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:23:32,155 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:23:32,155 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:23:32,156 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:23:32,156 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:23:32,157 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:23:32,158 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:23:32,159 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:23:32,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:23:32,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:23:32,167 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:23:32,168 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:23:32,168 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:23:32,169 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:23:32,170 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:23:32,170 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:23:32,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:23:32,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:23:32,186 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:23:32,187 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:23:32,188 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:23:32,188 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:23:32,188 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:23:32,188 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:23:32,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:23:32,189 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:23:32,189 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:23:32,189 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:23:32,189 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:23:32,189 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:23:32,189 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:23:32,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:23:32,190 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:23:32,191 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:23:32,191 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:23:32,231 INFO ]: Repository-Root is: /tmp [2018-06-22 01:23:32,244 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:23:32,249 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:23:32,250 INFO ]: Initializing SmtParser... [2018-06-22 01:23:32,250 INFO ]: SmtParser initialized [2018-06-22 01:23:32,251 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/008b-horn.smt2 [2018-06-22 01:23:32,253 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 01:23:32,347 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008b-horn.smt2 unknown [2018-06-22 01:23:32,580 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008b-horn.smt2 [2018-06-22 01:23:32,585 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:23:32,590 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:23:32,591 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:23:32,591 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:23:32,591 INFO ]: ChcToBoogie initialized [2018-06-22 01:23:32,594 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:23:32" (1/1) ... [2018-06-22 01:23:32,668 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:32 Unit [2018-06-22 01:23:32,669 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:23:32,669 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:23:32,669 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:23:32,669 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:23:32,692 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:32" (1/1) ... [2018-06-22 01:23:32,693 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:32" (1/1) ... [2018-06-22 01:23:32,699 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:32" (1/1) ... [2018-06-22 01:23:32,699 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:32" (1/1) ... [2018-06-22 01:23:32,703 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:32" (1/1) ... [2018-06-22 01:23:32,705 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:32" (1/1) ... [2018-06-22 01:23:32,707 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:32" (1/1) ... [2018-06-22 01:23:32,708 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:23:32,709 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:23:32,709 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:23:32,709 INFO ]: RCFGBuilder initialized [2018-06-22 01:23:32,710 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:32" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:23:32,728 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:23:32,728 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:23:32,728 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:23:32,728 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:23:32,728 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:23:32,729 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:23:33,097 INFO ]: Using library mode [2018-06-22 01:23:33,098 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:23:33 BoogieIcfgContainer [2018-06-22 01:23:33,098 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:23:33,099 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:23:33,099 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:23:33,102 INFO ]: TraceAbstraction initialized [2018-06-22 01:23:33,102 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:23:32" (1/3) ... [2018-06-22 01:23:33,103 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75634578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:23:33, skipping insertion in model container [2018-06-22 01:23:33,103 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:32" (2/3) ... [2018-06-22 01:23:33,103 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75634578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:23:33, skipping insertion in model container [2018-06-22 01:23:33,103 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:23:33" (3/3) ... [2018-06-22 01:23:33,105 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:23:33,113 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:23:33,119 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:23:33,153 INFO ]: Using default assertion order modulation [2018-06-22 01:23:33,154 INFO ]: Interprodecural is true [2018-06-22 01:23:33,154 INFO ]: Hoare is false [2018-06-22 01:23:33,154 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:23:33,154 INFO ]: Backedges is TWOTRACK [2018-06-22 01:23:33,154 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:23:33,154 INFO ]: Difference is false [2018-06-22 01:23:33,154 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:23:33,154 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:23:33,168 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 01:23:33,181 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:23:33,181 INFO ]: Found error trace [2018-06-22 01:23:33,182 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:33,182 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:33,188 INFO ]: Analyzing trace with hash -1869047154, now seen corresponding path program 1 times [2018-06-22 01:23:33,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:33,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:33,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:33,227 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:33,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:33,268 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:33,328 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:33,329 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:23:33,329 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:23:33,331 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:23:33,341 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:23:33,341 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:23:33,343 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 01:23:33,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:33,568 INFO ]: Finished difference Result 9 states and 29 transitions. [2018-06-22 01:23:33,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:23:33,569 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:23:33,570 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:33,577 INFO ]: With dead ends: 9 [2018-06-22 01:23:33,578 INFO ]: Without dead ends: 9 [2018-06-22 01:23:33,580 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:23:33,598 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 01:23:33,613 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 01:23:33,614 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:23:33,616 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2018-06-22 01:23:33,617 INFO ]: Start accepts. Automaton has 9 states and 29 transitions. Word has length 7 [2018-06-22 01:23:33,618 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:33,618 INFO ]: Abstraction has 9 states and 29 transitions. [2018-06-22 01:23:33,618 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:23:33,618 INFO ]: Start isEmpty. Operand 9 states and 29 transitions. [2018-06-22 01:23:33,618 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:23:33,618 INFO ]: Found error trace [2018-06-22 01:23:33,618 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:33,618 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:33,618 INFO ]: Analyzing trace with hash -2096538143, now seen corresponding path program 1 times [2018-06-22 01:23:33,619 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:33,619 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:33,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:33,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:33,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:33,663 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:33,740 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:33,741 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:33,741 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 01:23:33,747 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:33,796 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:33,805 INFO ]: Computing forward predicates... [2018-06-22 01:23:34,186 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:34,207 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:34,208 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-22 01:23:34,208 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:23:34,208 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:23:34,208 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:23:34,209 INFO ]: Start difference. First operand 9 states and 29 transitions. Second operand 6 states. [2018-06-22 01:23:34,637 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-22 01:23:35,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:35,463 INFO ]: Finished difference Result 20 states and 115 transitions. [2018-06-22 01:23:35,493 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:23:35,493 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-22 01:23:35,493 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:35,496 INFO ]: With dead ends: 20 [2018-06-22 01:23:35,496 INFO ]: Without dead ends: 20 [2018-06-22 01:23:35,497 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:23:35,497 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:23:35,501 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 01:23:35,501 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:23:35,502 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 113 transitions. [2018-06-22 01:23:35,502 INFO ]: Start accepts. Automaton has 18 states and 113 transitions. Word has length 8 [2018-06-22 01:23:35,502 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:35,502 INFO ]: Abstraction has 18 states and 113 transitions. [2018-06-22 01:23:35,502 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:23:35,502 INFO ]: Start isEmpty. Operand 18 states and 113 transitions. [2018-06-22 01:23:35,503 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:23:35,503 INFO ]: Found error trace [2018-06-22 01:23:35,503 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:35,503 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:35,503 INFO ]: Analyzing trace with hash -2092844059, now seen corresponding path program 1 times [2018-06-22 01:23:35,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:35,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:35,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:35,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:35,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:35,517 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:35,582 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:35,582 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:35,582 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 01:23:35,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:35,602 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:35,604 INFO ]: Computing forward predicates... [2018-06-22 01:23:35,606 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:35,629 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:35,629 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:23:35,630 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:23:35,630 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:23:35,630 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:23:35,630 INFO ]: Start difference. First operand 18 states and 113 transitions. Second operand 4 states. [2018-06-22 01:23:35,851 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:35,851 INFO ]: Finished difference Result 23 states and 160 transitions. [2018-06-22 01:23:35,851 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:23:35,851 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:23:35,851 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:35,853 INFO ]: With dead ends: 23 [2018-06-22 01:23:35,853 INFO ]: Without dead ends: 23 [2018-06-22 01:23:35,853 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 9 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 01:23:35,853 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:23:35,856 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-06-22 01:23:35,857 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:23:35,858 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 135 transitions. [2018-06-22 01:23:35,858 INFO ]: Start accepts. Automaton has 20 states and 135 transitions. Word has length 8 [2018-06-22 01:23:35,858 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:35,858 INFO ]: Abstraction has 20 states and 135 transitions. [2018-06-22 01:23:35,858 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:23:35,858 INFO ]: Start isEmpty. Operand 20 states and 135 transitions. [2018-06-22 01:23:35,859 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:23:35,859 INFO ]: Found error trace [2018-06-22 01:23:35,859 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:35,859 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:35,859 INFO ]: Analyzing trace with hash -2100232227, now seen corresponding path program 1 times [2018-06-22 01:23:35,859 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:35,859 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:35,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:35,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:35,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:35,870 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:35,981 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:35,981 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:23:35,981 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:23:35,981 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:23:35,981 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:23:35,981 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:23:35,981 INFO ]: Start difference. First operand 20 states and 135 transitions. Second operand 3 states. [2018-06-22 01:23:36,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:36,115 INFO ]: Finished difference Result 28 states and 211 transitions. [2018-06-22 01:23:36,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:23:36,116 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:23:36,116 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:36,117 INFO ]: With dead ends: 28 [2018-06-22 01:23:36,117 INFO ]: Without dead ends: 28 [2018-06-22 01:23:36,118 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:23:36,118 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:23:36,122 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-22 01:23:36,122 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:23:36,123 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 167 transitions. [2018-06-22 01:23:36,123 INFO ]: Start accepts. Automaton has 24 states and 167 transitions. Word has length 8 [2018-06-22 01:23:36,123 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:36,123 INFO ]: Abstraction has 24 states and 167 transitions. [2018-06-22 01:23:36,123 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:23:36,123 INFO ]: Start isEmpty. Operand 24 states and 167 transitions. [2018-06-22 01:23:36,124 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:23:36,124 INFO ]: Found error trace [2018-06-22 01:23:36,124 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:36,124 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:36,124 INFO ]: Analyzing trace with hash -558824210, now seen corresponding path program 2 times [2018-06-22 01:23:36,124 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:36,124 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:36,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:36,125 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:36,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:36,140 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:36,188 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:36,188 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:23:36,188 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:23:36,188 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:23:36,188 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:23:36,188 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:23:36,188 INFO ]: Start difference. First operand 24 states and 167 transitions. Second operand 3 states. [2018-06-22 01:23:36,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:36,214 INFO ]: Finished difference Result 20 states and 52 transitions. [2018-06-22 01:23:36,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:23:36,215 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:23:36,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:36,215 INFO ]: With dead ends: 20 [2018-06-22 01:23:36,215 INFO ]: Without dead ends: 16 [2018-06-22 01:23:36,216 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:23:36,216 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:23:36,219 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-06-22 01:23:36,219 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:23:36,219 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2018-06-22 01:23:36,220 INFO ]: Start accepts. Automaton has 14 states and 36 transitions. Word has length 9 [2018-06-22 01:23:36,220 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:36,220 INFO ]: Abstraction has 14 states and 36 transitions. [2018-06-22 01:23:36,220 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:23:36,220 INFO ]: Start isEmpty. Operand 14 states and 36 transitions. [2018-06-22 01:23:36,220 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:23:36,220 INFO ]: Found error trace [2018-06-22 01:23:36,220 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:36,220 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:36,220 INFO ]: Analyzing trace with hash -329791002, now seen corresponding path program 1 times [2018-06-22 01:23:36,220 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:36,220 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:36,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:36,221 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:23:36,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:36,250 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:36,438 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:36,438 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:36,438 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 01:23:36,451 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:36,484 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:36,486 INFO ]: Computing forward predicates... [2018-06-22 01:23:36,515 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:36,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:36,537 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-22 01:23:36,537 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:23:36,537 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:23:36,537 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:23:36,537 INFO ]: Start difference. First operand 14 states and 36 transitions. Second operand 6 states. [2018-06-22 01:23:36,642 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:36,642 INFO ]: Finished difference Result 21 states and 58 transitions. [2018-06-22 01:23:36,643 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:23:36,643 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-22 01:23:36,643 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:36,643 INFO ]: With dead ends: 21 [2018-06-22 01:23:36,643 INFO ]: Without dead ends: 21 [2018-06-22 01:23:36,644 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:23:36,644 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:23:36,646 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-06-22 01:23:36,646 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:23:36,647 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2018-06-22 01:23:36,647 INFO ]: Start accepts. Automaton has 15 states and 45 transitions. Word has length 9 [2018-06-22 01:23:36,647 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:36,647 INFO ]: Abstraction has 15 states and 45 transitions. [2018-06-22 01:23:36,647 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:23:36,647 INFO ]: Start isEmpty. Operand 15 states and 45 transitions. [2018-06-22 01:23:36,647 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:23:36,647 INFO ]: Found error trace [2018-06-22 01:23:36,647 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:36,647 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:36,648 INFO ]: Analyzing trace with hash -326096918, now seen corresponding path program 1 times [2018-06-22 01:23:36,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:36,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:36,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:36,648 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:36,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:36,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:36,701 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:36,701 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:23:36,701 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:23:36,701 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:23:36,701 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:23:36,701 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:23:36,701 INFO ]: Start difference. First operand 15 states and 45 transitions. Second operand 3 states. [2018-06-22 01:23:36,731 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:36,731 INFO ]: Finished difference Result 14 states and 31 transitions. [2018-06-22 01:23:36,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:23:36,732 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:23:36,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:36,732 INFO ]: With dead ends: 14 [2018-06-22 01:23:36,732 INFO ]: Without dead ends: 14 [2018-06-22 01:23:36,733 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:23:36,733 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:23:36,734 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:23:36,734 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:23:36,735 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2018-06-22 01:23:36,735 INFO ]: Start accepts. Automaton has 14 states and 31 transitions. Word has length 9 [2018-06-22 01:23:36,735 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:36,735 INFO ]: Abstraction has 14 states and 31 transitions. [2018-06-22 01:23:36,735 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:23:36,735 INFO ]: Start isEmpty. Operand 14 states and 31 transitions. [2018-06-22 01:23:36,735 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:23:36,735 INFO ]: Found error trace [2018-06-22 01:23:36,735 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:36,735 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:36,736 INFO ]: Analyzing trace with hash -351031985, now seen corresponding path program 1 times [2018-06-22 01:23:36,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:36,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:36,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:36,736 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:36,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:36,746 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:36,783 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:36,783 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:36,783 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 01:23:36,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:36,814 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:36,816 INFO ]: Computing forward predicates... [2018-06-22 01:23:36,952 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:36,972 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:23:36,972 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-06-22 01:23:36,972 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:23:36,972 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:23:36,972 INFO ]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:23:36,972 INFO ]: Start difference. First operand 14 states and 31 transitions. Second operand 7 states. [2018-06-22 01:23:37,084 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:37,084 INFO ]: Finished difference Result 17 states and 34 transitions. [2018-06-22 01:23:37,084 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:23:37,084 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-22 01:23:37,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:37,085 INFO ]: With dead ends: 17 [2018-06-22 01:23:37,085 INFO ]: Without dead ends: 17 [2018-06-22 01:23:37,085 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:23:37,085 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:23:37,087 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-22 01:23:37,087 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:23:37,087 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2018-06-22 01:23:37,087 INFO ]: Start accepts. Automaton has 14 states and 31 transitions. Word has length 9 [2018-06-22 01:23:37,087 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:37,087 INFO ]: Abstraction has 14 states and 31 transitions. [2018-06-22 01:23:37,087 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:23:37,088 INFO ]: Start isEmpty. Operand 14 states and 31 transitions. [2018-06-22 01:23:37,088 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:23:37,088 INFO ]: Found error trace [2018-06-22 01:23:37,088 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:37,088 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:37,088 INFO ]: Analyzing trace with hash -347337901, now seen corresponding path program 1 times [2018-06-22 01:23:37,088 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:37,088 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:37,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:37,089 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:37,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:37,098 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:37,174 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:37,174 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:37,174 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 01:23:37,184 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:37,197 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:37,199 INFO ]: Computing forward predicates... [2018-06-22 01:23:37,265 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:37,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:37,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 01:23:37,284 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:23:37,284 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:23:37,284 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:23:37,284 INFO ]: Start difference. First operand 14 states and 31 transitions. Second operand 8 states. [2018-06-22 01:23:37,667 WARN ]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 01:23:37,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:37,724 INFO ]: Finished difference Result 21 states and 40 transitions. [2018-06-22 01:23:37,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:23:37,726 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-22 01:23:37,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:37,727 INFO ]: With dead ends: 21 [2018-06-22 01:23:37,727 INFO ]: Without dead ends: 21 [2018-06-22 01:23:37,727 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:23:37,727 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:23:37,729 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-06-22 01:23:37,729 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:23:37,729 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 32 transitions. [2018-06-22 01:23:37,729 INFO ]: Start accepts. Automaton has 15 states and 32 transitions. Word has length 9 [2018-06-22 01:23:37,729 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:37,729 INFO ]: Abstraction has 15 states and 32 transitions. [2018-06-22 01:23:37,729 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:23:37,729 INFO ]: Start isEmpty. Operand 15 states and 32 transitions. [2018-06-22 01:23:37,729 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:23:37,729 INFO ]: Found error trace [2018-06-22 01:23:37,729 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:37,730 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:37,732 INFO ]: Analyzing trace with hash -1613155435, now seen corresponding path program 1 times [2018-06-22 01:23:37,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:37,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:37,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:37,732 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:37,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:37,743 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:37,807 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:37,807 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:37,807 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 01:23:37,813 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:37,829 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:37,831 INFO ]: Computing forward predicates... [2018-06-22 01:23:38,119 WARN ]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 01:23:38,173 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:38,192 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:38,192 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 01:23:38,192 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:23:38,192 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:23:38,192 INFO ]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:23:38,193 INFO ]: Start difference. First operand 15 states and 32 transitions. Second operand 10 states. [2018-06-22 01:23:38,936 WARN ]: Spent 638.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-06-22 01:23:40,776 WARN ]: Spent 1.71 s on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-06-22 01:23:41,465 WARN ]: Spent 662.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-06-22 01:23:42,113 WARN ]: Spent 638.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-06-22 01:23:42,406 WARN ]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:23:43,681 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:43,681 INFO ]: Finished difference Result 27 states and 50 transitions. [2018-06-22 01:23:43,681 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:23:43,682 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-22 01:23:43,682 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:43,682 INFO ]: With dead ends: 27 [2018-06-22 01:23:43,682 INFO ]: Without dead ends: 13 [2018-06-22 01:23:43,682 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:23:43,682 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:23:43,683 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-22 01:23:43,683 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:23:43,684 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-22 01:23:43,684 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2018-06-22 01:23:43,684 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:43,684 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-22 01:23:43,684 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:23:43,684 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-22 01:23:43,684 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:23:43,684 INFO ]: Found error trace [2018-06-22 01:23:43,684 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:43,684 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:43,684 INFO ]: Analyzing trace with hash -1395204479, now seen corresponding path program 2 times [2018-06-22 01:23:43,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:43,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:43,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:43,685 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:43,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:43,693 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:43,752 INFO ]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:43,752 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:43,752 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 01:23:43,761 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:23:43,811 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:23:43,811 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:43,812 INFO ]: Computing forward predicates... [2018-06-22 01:23:44,104 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:44,136 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:23:44,136 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-06-22 01:23:44,137 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:23:44,137 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:23:44,137 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:23:44,137 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 6 states. [2018-06-22 01:23:44,264 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:44,264 INFO ]: Finished difference Result 13 states and 17 transitions. [2018-06-22 01:23:44,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:23:44,264 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-22 01:23:44,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:44,264 INFO ]: With dead ends: 13 [2018-06-22 01:23:44,264 INFO ]: Without dead ends: 13 [2018-06-22 01:23:44,265 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:23:44,265 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:23:44,266 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-22 01:23:44,266 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:23:44,266 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-22 01:23:44,266 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2018-06-22 01:23:44,266 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:44,266 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-22 01:23:44,266 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:23:44,267 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-22 01:23:44,267 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:23:44,267 INFO ]: Found error trace [2018-06-22 01:23:44,267 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:44,267 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:44,267 INFO ]: Analyzing trace with hash -1412751378, now seen corresponding path program 2 times [2018-06-22 01:23:44,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:44,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:44,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:44,268 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:23:44,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:44,279 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:44,433 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:44,433 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:44,433 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 01:23:44,439 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:23:44,455 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:23:44,455 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:44,456 INFO ]: Computing forward predicates... [2018-06-22 01:23:44,486 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:44,505 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:44,505 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 01:23:44,505 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:23:44,505 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:23:44,506 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:23:44,506 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 7 states. [2018-06-22 01:23:44,579 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:44,579 INFO ]: Finished difference Result 14 states and 22 transitions. [2018-06-22 01:23:44,579 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:23:44,579 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-22 01:23:44,579 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:44,579 INFO ]: With dead ends: 14 [2018-06-22 01:23:44,579 INFO ]: Without dead ends: 14 [2018-06-22 01:23:44,580 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:23:44,580 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:23:44,581 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-22 01:23:44,581 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:23:44,581 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-22 01:23:44,581 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 10 [2018-06-22 01:23:44,581 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:44,581 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-22 01:23:44,581 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:23:44,581 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-22 01:23:44,581 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:23:44,581 INFO ]: Found error trace [2018-06-22 01:23:44,581 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:44,581 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:44,582 INFO ]: Analyzing trace with hash -281234854, now seen corresponding path program 2 times [2018-06-22 01:23:44,582 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:44,582 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:44,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:44,582 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:23:44,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:44,593 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:44,641 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:44,641 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:44,641 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 01:23:44,648 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:23:44,677 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:23:44,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:44,678 INFO ]: Computing forward predicates... [2018-06-22 01:23:44,813 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:44,844 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:44,844 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-22 01:23:44,844 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:23:44,845 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:23:44,845 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:23:44,845 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 9 states. [2018-06-22 01:23:45,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:45,121 INFO ]: Finished difference Result 16 states and 24 transitions. [2018-06-22 01:23:45,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:23:45,121 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-22 01:23:45,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:45,122 INFO ]: With dead ends: 16 [2018-06-22 01:23:45,122 INFO ]: Without dead ends: 13 [2018-06-22 01:23:45,122 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:23:45,122 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:23:45,123 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:23:45,123 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:23:45,123 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-22 01:23:45,123 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 11 [2018-06-22 01:23:45,123 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:45,123 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-22 01:23:45,123 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:23:45,124 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-22 01:23:45,124 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:23:45,124 INFO ]: Found error trace [2018-06-22 01:23:45,124 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:45,124 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:45,124 INFO ]: Analyzing trace with hash -80830797, now seen corresponding path program 3 times [2018-06-22 01:23:45,124 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:45,124 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:45,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:45,125 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:23:45,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:45,133 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:45,208 INFO ]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:45,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:45,208 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 01:23:45,214 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:23:45,234 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:23:45,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:45,236 INFO ]: Computing forward predicates... [2018-06-22 01:23:45,291 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:45,320 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:23:45,320 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-06-22 01:23:45,320 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:23:45,320 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:23:45,320 INFO ]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:23:45,320 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 7 states. [2018-06-22 01:23:45,412 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:45,412 INFO ]: Finished difference Result 15 states and 21 transitions. [2018-06-22 01:23:45,412 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:23:45,412 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-22 01:23:45,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:45,412 INFO ]: With dead ends: 15 [2018-06-22 01:23:45,412 INFO ]: Without dead ends: 15 [2018-06-22 01:23:45,413 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:23:45,413 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:23:45,414 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-06-22 01:23:45,414 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:23:45,414 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-22 01:23:45,414 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 11 [2018-06-22 01:23:45,414 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:45,414 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-22 01:23:45,414 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:23:45,414 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-22 01:23:45,414 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:23:45,414 INFO ]: Found error trace [2018-06-22 01:23:45,414 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:45,415 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:45,415 INFO ]: Analyzing trace with hash -939705327, now seen corresponding path program 1 times [2018-06-22 01:23:45,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:45,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:45,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:45,415 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:23:45,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:45,425 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:45,486 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:45,486 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:45,486 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 01:23:45,498 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:45,521 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:45,522 INFO ]: Computing forward predicates... [2018-06-22 01:23:46,466 WARN ]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 01:23:47,530 WARN ]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-06-22 01:23:47,534 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:47,554 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:47,554 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 01:23:47,554 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:23:47,554 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:23:47,554 INFO ]: CoverageRelationStatistics Valid=35, Invalid=95, Unknown=2, NotChecked=0, Total=132 [2018-06-22 01:23:47,554 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 12 states. [2018-06-22 01:23:50,252 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:50,252 INFO ]: Finished difference Result 16 states and 22 transitions. [2018-06-22 01:23:50,253 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:23:50,253 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-22 01:23:50,253 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:50,253 INFO ]: With dead ends: 16 [2018-06-22 01:23:50,253 INFO ]: Without dead ends: 13 [2018-06-22 01:23:50,253 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=47, Invalid=133, Unknown=2, NotChecked=0, Total=182 [2018-06-22 01:23:50,253 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:23:50,254 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:23:50,254 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:23:50,254 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-06-22 01:23:50,254 INFO ]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 11 [2018-06-22 01:23:50,254 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:50,254 INFO ]: Abstraction has 13 states and 18 transitions. [2018-06-22 01:23:50,254 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:23:50,254 INFO ]: Start isEmpty. Operand 13 states and 18 transitions. [2018-06-22 01:23:50,255 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:23:50,255 INFO ]: Found error trace [2018-06-22 01:23:50,255 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:50,255 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:50,255 INFO ]: Analyzing trace with hash -395751458, now seen corresponding path program 1 times [2018-06-22 01:23:50,255 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:50,255 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:50,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:50,255 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:50,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:50,285 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:50,530 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:50,530 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:50,530 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 01:23:50,537 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:50,554 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:50,556 INFO ]: Computing forward predicates... [2018-06-22 01:23:50,610 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:50,629 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:50,630 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:23:50,630 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:23:50,630 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:23:50,630 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:23:50,630 INFO ]: Start difference. First operand 13 states and 18 transitions. Second operand 7 states. [2018-06-22 01:23:50,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:50,666 INFO ]: Finished difference Result 15 states and 20 transitions. [2018-06-22 01:23:50,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:23:50,666 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-22 01:23:50,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:50,666 INFO ]: With dead ends: 15 [2018-06-22 01:23:50,666 INFO ]: Without dead ends: 15 [2018-06-22 01:23:50,667 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:23:50,667 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:23:50,668 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-22 01:23:50,668 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:23:50,668 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-06-22 01:23:50,668 INFO ]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-06-22 01:23:50,668 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:50,668 INFO ]: Abstraction has 14 states and 19 transitions. [2018-06-22 01:23:50,668 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:23:50,668 INFO ]: Start isEmpty. Operand 14 states and 19 transitions. [2018-06-22 01:23:50,669 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:23:50,669 INFO ]: Found error trace [2018-06-22 01:23:50,669 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:50,669 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:50,669 INFO ]: Analyzing trace with hash -1941369803, now seen corresponding path program 3 times [2018-06-22 01:23:50,669 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:50,669 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:50,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:50,670 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:50,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:50,678 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:51,261 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:51,261 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:51,261 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:23:51,275 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:23:51,353 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:23:51,353 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:51,355 INFO ]: Computing forward predicates... [2018-06-22 01:23:52,129 WARN ]: Spent 451.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 01:23:52,153 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:52,186 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:52,186 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 01:23:52,186 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:23:52,186 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:23:52,186 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:23:52,186 INFO ]: Start difference. First operand 14 states and 19 transitions. Second operand 10 states. [2018-06-22 01:23:52,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:52,285 INFO ]: Finished difference Result 18 states and 27 transitions. [2018-06-22 01:23:52,285 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:23:52,285 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-22 01:23:52,285 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:52,285 INFO ]: With dead ends: 18 [2018-06-22 01:23:52,285 INFO ]: Without dead ends: 14 [2018-06-22 01:23:52,286 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:23:52,286 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:23:52,287 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:23:52,287 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:23:52,287 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-06-22 01:23:52,287 INFO ]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 12 [2018-06-22 01:23:52,287 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:52,287 INFO ]: Abstraction has 14 states and 20 transitions. [2018-06-22 01:23:52,287 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:23:52,287 INFO ]: Start isEmpty. Operand 14 states and 20 transitions. [2018-06-22 01:23:52,288 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:23:52,288 INFO ]: Found error trace [2018-06-22 01:23:52,288 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:52,288 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:52,288 INFO ]: Analyzing trace with hash 1695127020, now seen corresponding path program 2 times [2018-06-22 01:23:52,288 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:52,288 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:52,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:52,289 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:23:52,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:52,321 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:52,480 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:52,480 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:52,480 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 01:23:52,485 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:23:52,531 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:23:52,531 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:52,533 INFO ]: Computing forward predicates... [2018-06-22 01:23:52,574 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:52,600 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:52,600 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 01:23:52,600 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:23:52,600 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:23:52,600 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:23:52,600 INFO ]: Start difference. First operand 14 states and 20 transitions. Second operand 9 states. [2018-06-22 01:23:52,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:52,685 INFO ]: Finished difference Result 16 states and 22 transitions. [2018-06-22 01:23:52,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:23:52,685 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-22 01:23:52,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:52,685 INFO ]: With dead ends: 16 [2018-06-22 01:23:52,685 INFO ]: Without dead ends: 16 [2018-06-22 01:23:52,685 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:23:52,685 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:23:52,686 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-06-22 01:23:52,686 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:23:52,687 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-06-22 01:23:52,687 INFO ]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 12 [2018-06-22 01:23:52,687 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:52,687 INFO ]: Abstraction has 15 states and 21 transitions. [2018-06-22 01:23:52,687 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:23:52,687 INFO ]: Start isEmpty. Operand 15 states and 21 transitions. [2018-06-22 01:23:52,687 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:23:52,687 INFO ]: Found error trace [2018-06-22 01:23:52,687 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:52,687 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:52,687 INFO ]: Analyzing trace with hash -2055886407, now seen corresponding path program 2 times [2018-06-22 01:23:52,688 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:52,688 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:52,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:52,688 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:23:52,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:52,697 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:52,875 INFO ]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:52,875 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:52,875 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 01:23:52,881 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:23:52,902 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:23:52,902 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:52,904 INFO ]: Computing forward predicates... [2018-06-22 01:23:53,041 INFO ]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:53,062 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:53,062 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-22 01:23:53,062 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:23:53,062 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:23:53,062 INFO ]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:23:53,063 INFO ]: Start difference. First operand 15 states and 21 transitions. Second operand 9 states. [2018-06-22 01:23:53,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:53,118 INFO ]: Finished difference Result 18 states and 24 transitions. [2018-06-22 01:23:53,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:23:53,118 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-22 01:23:53,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:53,118 INFO ]: With dead ends: 18 [2018-06-22 01:23:53,118 INFO ]: Without dead ends: 18 [2018-06-22 01:23:53,119 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:23:53,119 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:23:53,120 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-06-22 01:23:53,120 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:23:53,120 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-06-22 01:23:53,120 INFO ]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 12 [2018-06-22 01:23:53,120 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:53,120 INFO ]: Abstraction has 15 states and 21 transitions. [2018-06-22 01:23:53,120 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:23:53,120 INFO ]: Start isEmpty. Operand 15 states and 21 transitions. [2018-06-22 01:23:53,121 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:23:53,121 INFO ]: Found error trace [2018-06-22 01:23:53,121 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:53,121 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:53,121 INFO ]: Analyzing trace with hash -1865945670, now seen corresponding path program 4 times [2018-06-22 01:23:53,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:53,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:53,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:53,121 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:23:53,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:53,133 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:53,205 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:53,205 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:53,205 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 01:23:53,211 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:23:53,240 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:23:53,240 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:53,242 INFO ]: Computing forward predicates... [2018-06-22 01:23:53,273 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:53,293 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:53,293 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 01:23:53,293 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:23:53,293 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:23:53,293 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:23:53,294 INFO ]: Start difference. First operand 15 states and 21 transitions. Second operand 10 states. [2018-06-22 01:23:53,406 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:53,406 INFO ]: Finished difference Result 21 states and 31 transitions. [2018-06-22 01:23:53,406 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:23:53,406 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 01:23:53,406 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:53,407 INFO ]: With dead ends: 21 [2018-06-22 01:23:53,407 INFO ]: Without dead ends: 21 [2018-06-22 01:23:53,407 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:23:53,407 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:23:53,408 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-06-22 01:23:53,408 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:23:53,409 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2018-06-22 01:23:53,409 INFO ]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 13 [2018-06-22 01:23:53,409 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:53,409 INFO ]: Abstraction has 16 states and 26 transitions. [2018-06-22 01:23:53,409 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:23:53,409 INFO ]: Start isEmpty. Operand 16 states and 26 transitions. [2018-06-22 01:23:53,409 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:23:53,409 INFO ]: Found error trace [2018-06-22 01:23:53,409 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:53,409 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:53,409 INFO ]: Analyzing trace with hash 1770551153, now seen corresponding path program 3 times [2018-06-22 01:23:53,409 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:53,409 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:53,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:53,410 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:23:53,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:53,417 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:53,486 INFO ]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:53,486 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:53,486 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 01:23:53,493 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:23:53,518 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:23:53,518 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:53,520 INFO ]: Computing forward predicates... [2018-06-22 01:23:53,596 INFO ]: Checked inductivity of 21 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:53,615 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:53,615 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 01:23:53,615 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:23:53,615 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:23:53,615 INFO ]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:23:53,615 INFO ]: Start difference. First operand 16 states and 26 transitions. Second operand 10 states. [2018-06-22 01:23:53,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:23:53,674 INFO ]: Finished difference Result 22 states and 32 transitions. [2018-06-22 01:23:53,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:23:53,676 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 01:23:53,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:23:53,676 INFO ]: With dead ends: 22 [2018-06-22 01:23:53,676 INFO ]: Without dead ends: 22 [2018-06-22 01:23:53,676 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:23:53,676 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:23:53,677 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-22 01:23:53,677 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:23:53,677 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2018-06-22 01:23:53,678 INFO ]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 13 [2018-06-22 01:23:53,678 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:23:53,678 INFO ]: Abstraction has 16 states and 26 transitions. [2018-06-22 01:23:53,678 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:23:53,678 INFO ]: Start isEmpty. Operand 16 states and 26 transitions. [2018-06-22 01:23:53,678 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:23:53,678 INFO ]: Found error trace [2018-06-22 01:23:53,678 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:23:53,678 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:23:53,678 INFO ]: Analyzing trace with hash 1885067757, now seen corresponding path program 1 times [2018-06-22 01:23:53,678 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:23:53,678 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:23:53,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:53,679 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:23:53,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:23:53,689 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:53,805 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:53,805 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:23:53,805 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 01:23:53,811 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:23:53,847 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:23:53,850 INFO ]: Computing forward predicates... [2018-06-22 01:23:55,834 WARN ]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-22 01:23:57,541 WARN ]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-06-22 01:23:57,555 INFO ]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:23:57,574 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:23:57,574 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 01:23:57,574 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:23:57,574 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:23:57,574 INFO ]: CoverageRelationStatistics Valid=62, Invalid=172, Unknown=6, NotChecked=0, Total=240 [2018-06-22 01:23:57,574 INFO ]: Start difference. First operand 16 states and 26 transitions. Second operand 16 states. [2018-06-22 01:23:58,249 WARN ]: Spent 654.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2018-06-22 01:23:58,601 WARN ]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-22 01:24:15,735 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:15,735 INFO ]: Finished difference Result 21 states and 31 transitions. [2018-06-22 01:24:15,737 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:24:15,737 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-22 01:24:15,737 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:15,737 INFO ]: With dead ends: 21 [2018-06-22 01:24:15,737 INFO ]: Without dead ends: 17 [2018-06-22 01:24:15,737 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=83, Invalid=217, Unknown=6, NotChecked=0, Total=306 [2018-06-22 01:24:15,737 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:24:15,739 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-06-22 01:24:15,739 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:24:15,739 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-06-22 01:24:15,739 INFO ]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 13 [2018-06-22 01:24:15,739 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:15,739 INFO ]: Abstraction has 16 states and 24 transitions. [2018-06-22 01:24:15,739 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:24:15,739 INFO ]: Start isEmpty. Operand 16 states and 24 transitions. [2018-06-22 01:24:15,739 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:24:15,739 INFO ]: Found error trace [2018-06-22 01:24:15,739 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:15,739 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:15,740 INFO ]: Analyzing trace with hash 712461858, now seen corresponding path program 3 times [2018-06-22 01:24:15,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:15,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:15,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:15,740 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:15,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:15,752 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:15,846 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:15,846 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:15,846 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 01:24:15,852 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:24:15,883 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:24:15,883 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:15,884 INFO ]: Computing forward predicates... [2018-06-22 01:24:16,077 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:16,096 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:16,096 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 01:24:16,096 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:24:16,096 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:24:16,096 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:24:16,096 INFO ]: Start difference. First operand 16 states and 24 transitions. Second operand 11 states. [2018-06-22 01:24:16,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:16,211 INFO ]: Finished difference Result 20 states and 28 transitions. [2018-06-22 01:24:16,211 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:24:16,211 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-22 01:24:16,211 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:16,212 INFO ]: With dead ends: 20 [2018-06-22 01:24:16,212 INFO ]: Without dead ends: 16 [2018-06-22 01:24:16,212 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:24:16,212 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:24:16,213 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 01:24:16,213 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:24:16,213 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-06-22 01:24:16,213 INFO ]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 13 [2018-06-22 01:24:16,213 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:16,214 INFO ]: Abstraction has 16 states and 23 transitions. [2018-06-22 01:24:16,214 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:24:16,214 INFO ]: Start isEmpty. Operand 16 states and 23 transitions. [2018-06-22 01:24:16,214 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:24:16,214 INFO ]: Found error trace [2018-06-22 01:24:16,214 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:16,214 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:16,214 INFO ]: Analyzing trace with hash -1989309887, now seen corresponding path program 5 times [2018-06-22 01:24:16,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:16,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:16,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:16,215 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:16,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:16,223 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:16,280 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:16,280 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:16,280 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 01:24:16,285 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:24:16,317 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:24:16,317 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:16,319 INFO ]: Computing forward predicates... [2018-06-22 01:24:16,771 WARN ]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 01:24:17,114 WARN ]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:24:17,774 WARN ]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-22 01:24:17,777 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:17,796 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:17,796 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-22 01:24:17,797 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:24:17,797 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:24:17,797 INFO ]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:24:17,797 INFO ]: Start difference. First operand 16 states and 23 transitions. Second operand 14 states. [2018-06-22 01:24:19,454 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:19,454 INFO ]: Finished difference Result 23 states and 34 transitions. [2018-06-22 01:24:19,455 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:24:19,455 INFO ]: Start accepts. Automaton has 14 states. Word has length 14 [2018-06-22 01:24:19,455 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:19,455 INFO ]: With dead ends: 23 [2018-06-22 01:24:19,455 INFO ]: Without dead ends: 17 [2018-06-22 01:24:19,455 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:24:19,455 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:24:19,456 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-06-22 01:24:19,456 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:24:19,457 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-06-22 01:24:19,457 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 14 [2018-06-22 01:24:19,457 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:19,457 INFO ]: Abstraction has 16 states and 20 transitions. [2018-06-22 01:24:19,457 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:24:19,457 INFO ]: Start isEmpty. Operand 16 states and 20 transitions. [2018-06-22 01:24:19,457 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:24:19,457 INFO ]: Found error trace [2018-06-22 01:24:19,457 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:19,457 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:19,457 INFO ]: Analyzing trace with hash 472202453, now seen corresponding path program 6 times [2018-06-22 01:24:19,457 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:19,457 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:19,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:19,458 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:19,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:19,469 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:19,538 INFO ]: Checked inductivity of 28 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:19,538 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:19,538 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 01:24:19,544 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:24:19,571 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:24:19,571 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:19,573 INFO ]: Computing forward predicates... [2018-06-22 01:24:19,635 INFO ]: Checked inductivity of 28 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:19,654 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:19,654 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 01:24:19,654 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:24:19,654 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:24:19,654 INFO ]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:24:19,654 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 11 states. [2018-06-22 01:24:19,704 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:19,704 INFO ]: Finished difference Result 19 states and 23 transitions. [2018-06-22 01:24:19,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:24:19,704 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-22 01:24:19,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:19,705 INFO ]: With dead ends: 19 [2018-06-22 01:24:19,705 INFO ]: Without dead ends: 19 [2018-06-22 01:24:19,705 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:24:19,705 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:24:19,706 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-06-22 01:24:19,706 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:24:19,707 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-06-22 01:24:19,707 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 14 [2018-06-22 01:24:19,707 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:19,708 INFO ]: Abstraction has 16 states and 20 transitions. [2018-06-22 01:24:19,708 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:24:19,708 INFO ]: Start isEmpty. Operand 16 states and 20 transitions. [2018-06-22 01:24:19,708 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:24:19,708 INFO ]: Found error trace [2018-06-22 01:24:19,708 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:19,708 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:19,708 INFO ]: Analyzing trace with hash -71751416, now seen corresponding path program 2 times [2018-06-22 01:24:19,708 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:19,708 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:19,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:19,709 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:19,709 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:19,724 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:19,837 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:19,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:19,837 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 01:24:19,847 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:24:19,879 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:24:19,879 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:19,881 INFO ]: Computing forward predicates... [2018-06-22 01:24:19,913 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:19,932 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:19,932 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 01:24:19,932 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:24:19,932 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:24:19,932 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:24:19,932 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 11 states. [2018-06-22 01:24:20,159 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:20,159 INFO ]: Finished difference Result 19 states and 27 transitions. [2018-06-22 01:24:20,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:24:20,159 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-22 01:24:20,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:20,159 INFO ]: With dead ends: 19 [2018-06-22 01:24:20,159 INFO ]: Without dead ends: 19 [2018-06-22 01:24:20,160 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:24:20,160 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:24:20,161 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 01:24:20,161 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:24:20,161 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-06-22 01:24:20,161 INFO ]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 14 [2018-06-22 01:24:20,161 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:20,161 INFO ]: Abstraction has 17 states and 25 transitions. [2018-06-22 01:24:20,161 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:24:20,161 INFO ]: Start isEmpty. Operand 17 states and 25 transitions. [2018-06-22 01:24:20,162 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:24:20,162 INFO ]: Found error trace [2018-06-22 01:24:20,162 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:20,162 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:20,162 INFO ]: Analyzing trace with hash 1773805190, now seen corresponding path program 7 times [2018-06-22 01:24:20,162 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:20,162 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:20,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:20,162 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:20,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:20,193 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:20,335 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:20,335 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:20,335 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 01:24:20,340 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:20,385 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:20,388 INFO ]: Computing forward predicates... [2018-06-22 01:24:25,656 WARN ]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:24:26,131 WARN ]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-22 01:24:34,411 WARN ]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 55 [2018-06-22 01:24:34,414 INFO ]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:34,433 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:34,433 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-22 01:24:34,433 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:24:34,433 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:24:34,433 INFO ]: CoverageRelationStatistics Valid=85, Invalid=283, Unknown=12, NotChecked=0, Total=380 [2018-06-22 01:24:34,433 INFO ]: Start difference. First operand 17 states and 25 transitions. Second operand 20 states. [2018-06-22 01:24:35,311 WARN ]: Spent 821.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-06-22 01:24:37,232 WARN ]: Spent 1.12 s on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-06-22 01:24:40,401 WARN ]: Spent 2.50 s on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-06-22 01:24:45,189 WARN ]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 34 Received shutdown request... [2018-06-22 01:24:49,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:24:49,254 WARN ]: Verification canceled [2018-06-22 01:24:49,258 WARN ]: Timeout [2018-06-22 01:24:49,259 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:24:49 BoogieIcfgContainer [2018-06-22 01:24:49,259 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:24:49,259 INFO ]: Toolchain (without parser) took 76674.35 ms. Allocated memory was 309.3 MB in the beginning and 390.6 MB in the end (delta: 81.3 MB). Free memory was 261.9 MB in the beginning and 233.7 MB in the end (delta: 28.2 MB). Peak memory consumption was 109.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:24:49,260 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 273.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:24:49,260 INFO ]: ChcToBoogie took 78.27 ms. Allocated memory is still 309.3 MB. Free memory was 260.9 MB in the beginning and 258.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:24:49,261 INFO ]: Boogie Preprocessor took 39.05 ms. Allocated memory is still 309.3 MB. Free memory was 258.9 MB in the beginning and 257.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 01:24:49,261 INFO ]: RCFGBuilder took 389.18 ms. Allocated memory is still 309.3 MB. Free memory was 256.9 MB in the beginning and 242.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:24:49,261 INFO ]: TraceAbstraction took 76159.78 ms. Allocated memory was 309.3 MB in the beginning and 390.6 MB in the end (delta: 81.3 MB). Free memory was 242.9 MB in the beginning and 233.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 90.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:24:49,265 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 309.3 MB. Free memory is still 273.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 78.27 ms. Allocated memory is still 309.3 MB. Free memory was 260.9 MB in the beginning and 258.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.05 ms. Allocated memory is still 309.3 MB. Free memory was 258.9 MB in the beginning and 257.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 389.18 ms. Allocated memory is still 309.3 MB. Free memory was 256.9 MB in the beginning and 242.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 76159.78 ms. Allocated memory was 309.3 MB in the beginning and 390.6 MB in the end (delta: 81.3 MB). Free memory was 242.9 MB in the beginning and 233.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 90.5 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 (17states) and interpolant automaton (currently 11 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (13 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 76.1s OverallTime, 27 OverallIterations, 5 TraceHistogramMax, 46.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 223 SDtfs, 64 SDslu, 628 SDs, 0 SdLazy, 1696 SolverSat, 370 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 29.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 194 SyntacticMatches, 43 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 42.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=4, 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.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 54 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 27.1s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 507 ConstructedInterpolants, 43 QuantifiedInterpolants, 29555 SizeOfPredicates, 70 NumberOfNonLiveVariables, 4227 ConjunctsInSsa, 589 ConjunctsInUnsatCore, 50 InterpolantComputations, 7 PerfectInterpolantSequences, 137/643 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/008b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-24-49-275.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-24-49-275.csv Completed graceful shutdown